To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Every word in the lexicon of a natural language is used distinctly from all the other words. A word expert is a small expert system-like module for processing a particular word based on other words in its vicinity. A word expert exploits the idiosyncratic nature of a word by using a set of context testing decision rules that test the identity and placement of context words to infer the word's role in the passage.
The main application of word experts is disambiguating words. Work on word experts has never fully recognized previous related work, and a comprehensive review of that work would therefore contribute to the field. This paper both provides such a review, and describes guidelines and considerations useful in the design and construction of word expert based systems.
This paper is an introduction to natural language interfaces to databases (NLIDBS). A brief overview of the history of NLIDBS is first given. Some advantages and disadvantages of NLIDBS are then discussed, comparing NLIDBS to formal query languages, form-based interfaces, and graphical interfaces. An introduction to some of the linguistic problems NLIDBS have to confront follows, for the benefit of readers less familiar with computational linguistics. The discussion then moves on to NLIDB architectures, portability issues, restricted natural language input systems (including menu-based NLIDBS), and NLIDBS with reasoning capabilities. Some less explored areas of NLIDB research are then presented, namely database updates, meta-knowledge questions, temporal questions, and multi-modal NLIDBS. The paper ends with reflections on the current state of the art.
The Portable Extendable Traffic Information Collator (POETIC) is an information extraction system that extracts traffic information from free text occurring in police incident logs and initiates (simulated) broadcasts of traffic bulletins to motorists when appropriate. POETIC is a second stage prototype system; the initial prototype (TIC, see Evans and Hartley 1990) was limited to the practices and requirements of a single police force. In POETIC, the architecture and data representations have been generalised to make the system tailorable to many different police force ‘domains’. In this paper we describe these developments, and report on tests of the system on authentic input data from three police domains.
This paper describes a natural language text extraction system, called MEDLEE, that has been applied to the medical domain. The system extracts, structures, and encodes clinical information from textual patient reports. It was integrated with the Clinical Information System (CIS), which was developed at Columbia-Presbyterian Medical Center (CPMC) to help improve patient care. MEDLEE is currently used on a daily basis to routinely process radiological reports of patients at CPMC.
In order to describe how the natural language system was made compatible with the existing CIS, this paper will also discuss engineering issues which involve performance, robustness, and accessibility of the data from the end users' viewpoint.
Also described are the three evaluations that have been performed on the system. The first evaluation was useful primarily for further refinement of the system. The two other evaluations involved an actual clinical application which consisted of retrieving reports that were associated with specified diseases. Automated queries were written by a medical expert based on the structured output forms generated as a result of text processing. The retrievals obtained by the automated system were compared to the retrievals obtained by independent medical experts who read the reports manually to determine whether they were associated with the specified diseases. MEDLEE was shown to perform comparably to the experts. The technique used to perform the last two evaluations was found to be a realistic evaluation technique for a natural language processor.
Due to recent developments in the area of computational formalisms for linguistic representation, the task of designing a parser for a specified natural language is now shifted to the problem of designing its grammar in certain formal ways. This paper describes the results of a project whose aim was to design a formal grammar for modern Hebrew. Such a formal grammar has never been developed before. Since most of the work on grammatical formalisms was done without regarding Hebrew (and other Semitic languages as well), we had to choose a formalism that would best fit the specific needs of the language. This part of the project has been described elsewhere. In this paper we describe the details of the grammar we developed. The grammar deals with simple, subordinate and coordinate sentences as well as interrogative sentences. Some structures were thoroughly dealt with, among which are noun phrases, verb phrases, adjectival phrases, relative clauses, object and adjunct clauses; many types of adjuncts; subcategorization of verbs; coordination; numerals, etc. For each phrase the parser produces a description of the structure tree of the phrase as well as a representation of the syntactic relations in it. Many examples of Hebrew phrases are demonstrated, together with the structure the parser assigns them. In cases where more than one parse is produced, the reasons of the ambiguity are discussed.
We discuss a hierarchical probabilistic model whose predictions are similar to those of the popular language modelling procedure known as ‘smoothing’. A number of interesting differences from smoothing emerge. The insights gained from a probabilistic view of this problem point towards new directions for language modelling. The ideas of this paper are also applicable to other problems such as the modelling of triphomes in speech, and DNA and protein sequences in molecular biology. The new algorithm is compared with smoothing on a two million word corpus. The methods prove to be about equally accurate, with the hierarchical model using fewer computational resources.
In this chapter a compendium of all the schemes discussed is given, along with the source of the scheme in the argumentation literature. We have tried to make the compendium most useful to the reader by presenting the schemes that represent the most commonly used forms of argument, including not only those used in everyday discourse, but also certain schemes that are important in legal and scientific reasoning. Many of these schemes have subtypes, and research on the classification of the subtypes, and even more generally, research on determining which schemes are subspecies of other schemes, is not yet at an advanced stage. Thus while we have made occasional remarks on these matters, hoping to provide some insight, we have not generally listed all the known subspecies of the schemes. There are two especially important exceptions that need to be noted.
We have included a fairly comprehensive account of the known subschemes of the argument from popular opinion, to give the reader an idea of how it can be important to recognize many of these different subschemes in dealing with common arguments of the type associated with informal fallacies. The other important exception is the case of the argumentum ad hominem. Many subschemes for this type of argument have been recognized, and much work on trying to organize and classify them has been conducted (Walton, 1998).
It would be very helpful for users of the schemes to have a more refined system of classification, so that the user could search through to find a scheme applicable to her needs in a given case by searching under other, more general ones where the particular scheme being sought is known to fit. It is already fairly evident from the compendium of schemes that some schemes fit under others as subspecies of them. For example, one of the most common schemes is argument from consequences. It is closely related to practical reasoning. Other schemes, like those for the slippery slope argument, often fit under the category of argument from consequences. However, such classifications are not as straightforward as they initially seem. For example, some slippery slope arguments fit under the category of arguments from precedent, and therefore may not fit the scheme of argument from consequences, at least in any straightforward way. Another very common scheme under which many others fit as subspecies is the scheme for argument from commitment. Here we have a cluster of schemes that are closely related to each other, but in complex ways. Schemes that are very general, like those for argument from consequences and argument from ignorance, are related to many other, more specific schemes that fall under them. This chapter sets us on the road to beginning the research project of taking such clusters of schemes and investigating how they fit together with their neighboring schemes.
In this chapter, we outline a number of schemes that do not fall into any single classification but are useful to know about before considering the schemes discussed in the next chapters. We begin with a group of schemes based on assumptions about knowledge and go on to consider a group related to actions, goals, and means. These latter include schemes representing practical reasoning and arguing from the consequences of an action that is being considered. Finally, we consider some other schemes that are not easily classified, including arguments from composition and division, fear appeal arguments, appeals to pity, and argument from alternatives and opposites. Some work has been done on some of these schemes, while others remain largely unstudied.
ARGUMENTS FROM KNOWLEDGE
In arguments from expert opinion, position to know, and witness testimony, the acceptability of the conclusion is drawn from a knowledge base that the source is assumed to have access to. The relation between the latter and the plausibility of the conclusion is based on a kind of default reasoning: it is assumed that the proposition in question is contained in a certain subject domain that is known by the source. For this reason, it is an assumption in this kind of argumentation that many or most of the true propositions of the domain are known. The warrant of this kind of argumentation is therefore closely similar to that of the argument from ignorance.
Argumentation theory has laid foundations for and has had influence upon a wide variety of computational systems (Reed and Norman, 2003). This chapter explores four distinct areas, reviewing the ways in which argumentation schemes have been put to work: in natural language generation, in interagent communication, in automated reasoning, and in various specific computational applications. To start, however, we look at the tools that are being used to support the development of these applications and that allow the creation, analysis, and manipulation of the raw computational resources that involve argumentation schemes.
SCHEMES IN ARAUCARIA
Following work examining the diagramming of natural argument – an important topic from the practical, pedagogic point of view (van Gelder and Rizzo, 2001), but also a driver of theoretical development in informal logic (Walton & Reed, 2004) – Reed and Rowe (2004) developed Araucaria, a system for aiding human analysts and students in marking up argument. Araucaria adopts the “standard treatment” (Freeman, 1991) for argument analysis, based on identification of propositions (as vertices in a diagram) and the relationships of support and attack holding between them (edges in a diagram). It is thus similar to a range of argument visualization tools (see Kirschner et al., 2003, for an overview), and familiar from AI techniques such as Pollock's (1995) inference graphs and even Bayesian nets and qualitative probabilistic networks.
This chapter introduces the reader to argumentation schemes and explains, through the use of some examples, why they are important. Another aim of the chapter is to briefly review the literature on argumentation schemes, including the key works by Hastings, Walton, and Kienpointner, and to set it in a broader context, bringing out some characteristics of defeasible reasoning and argument evaluation that are fundamental to the study of schemes. Another is to introduce the beginning reader to some basic tools, like argument diagramming, that utilize schemes and need to be integrated with them. In this chapter we will introduce the reader to an automated system of argument diagramming called Araucaria. This technique is a box-and-arrow representation of the premises and conclusions of an argument, showing how one argument can be chained together with others to form a sequence of reasoning. This tool will be used in subsequent chapters, and so we need to introduce the reader to it now. One of our goals in the book is to show how argumentation schemes are in the process of being modeled by argument technology in the field of artificial intelligence (AI). However, we will reserve our fullest account of these developments for the last chapter of the book, even though, from time to time, we will mention aspects of them that impinge on our fundamental understanding of argumentation schemes as forms of reasoning.