Results 1 - 10
of
100
Generation and Synchronous Tree-Adjoining Grammars
, 1990
"... Tree-adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We dem ..."
Abstract
-
Cited by 774 (43 self)
- Add to MetaCart
(Show Context)
Tree-adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We demonstrate that this intuition can be made concrete by using the formalism of synchronous tree-adjoining grammars. The use of synchronous TAGs for generation provides solutions to several problems with previous approaches to TAG generation. Furthermore, the semantic monotonicity requirement previously advocated for generation gram- mars as a computational aid is seen to be an inherent property of synchronous TAGs.
Interpretation as Abduction
, 1990
"... An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. Its use in solving the local pragmatics problems of reference, compound nominals, syntactic ambiguity, and metonymy is described ..."
Abstract
-
Cited by 687 (38 self)
- Add to MetaCart
An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. Its use in solving the local pragmatics problems of reference, compound nominals, syntactic ambiguity, and metonymy is described and illustrated. It also suggests an elegant and thorough integration of syntax, semantics, and pragmatics. 1
A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms
- IN 27TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 1989
"... We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semanticall ..."
Abstract
-
Cited by 45 (8 self)
- Add to MetaCart
(Show Context)
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike topdown methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion.
Reining in CCG chart realization
- In Proc. INLG-04
, 2004
"... Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (CCG), but we conjecture that they can be adapted to related grammatical frameworks as well. The ensemble includes two ne ..."
Abstract
-
Cited by 41 (10 self)
- Add to MetaCart
Abstract. We present a novel ensemble of six methods for improving the efficiency of chart realization. The methods are couched in the framework of Combinatory Categorial Grammar (CCG), but we conjecture that they can be adapted to related grammatical frameworks as well. The ensemble includes two new methods introduced here— feature-based licensing and instantiation of edges, and caching of category combinations—in addition to four previously introduced methods— index filtering, LF chunking, edge pruning based on n-gram scores, and anytime search. We compare the relative contributions of each method using two test grammars, and show that the methods work best in combination. Our evaluation also indicates that despite the exponential worstcase complexity of the basic algorithm, the methods together can constrain the realization problem sufficiently to meet the interactive needs of natural language dialogue systems. 1
The Problem of Logical-Form Equivalence
- Computational Linguistics
, 1992
"... this paper, I review the problem, and attempt to highlight certain salient aspects of it that have been lost in the pursuing of solutions, in order to reconcile the apparently contradictory claims of the problem's intractability and its resolution. 2 Review of Natural-Language Generation ..."
Abstract
-
Cited by 33 (0 self)
- Add to MetaCart
(Show Context)
this paper, I review the problem, and attempt to highlight certain salient aspects of it that have been lost in the pursuing of solutions, in order to reconcile the apparently contradictory claims of the problem's intractability and its resolution. 2 Review of Natural-Language Generation
An Overview of Head driven Bottom-up Generation
- Current Research in Natural Language Generation
, 1994
"... In this paper I will discuss the properties of a tactical generation approach that has become popular recently: head-driven bottom-up generation. It is assumed that bidirectional grammars written in some unificationor logic-based formalism define relations between strings and some representation, u ..."
Abstract
-
Cited by 31 (5 self)
- Add to MetaCart
(Show Context)
In this paper I will discuss the properties of a tactical generation approach that has become popular recently: head-driven bottom-up generation. It is assumed that bidirectional grammars written in some unificationor logic-based formalism define relations between strings and some representation, usually called logical form. The task for a generator is to generate for a given logical form the strings that are related to this logical form by the grammar. In the paper it will be shown that the `early' approaches to this conceivement of the generation problem such as [21], [31] and [7] are not entirely satisfactory for general purposes. Furthermore I will define a simple bottom-up generator, called BUG1 for reference, as prototypical for the head-driven bottom-up approach as defended by for example [30, 5, 23, 24]. I will argue that head-driven bottom-up generation is to be preferred because the order of processing is directed by the input logical form and the information available in le...
Discourse representation and discourse management for natural language interfaces
- In Proceedings of the Second Nordic Conference on Text Comprehension in Man and Machine, Taby
, 1990
"... In this paper we discuss some requirements on natural language interfaces that are needed for supporting connected dialogue, and propose methods for meeting these requirements in the context of a system that has been developed at our department over the last couple of years. On the basis of data col ..."
Abstract
-
Cited by 27 (8 self)
- Add to MetaCart
In this paper we discuss some requirements on natural language interfaces that are needed for supporting connected dialogue, and propose methods for meeting these requirements in the context of a system that has been developed at our department over the last couple of years. On the basis of data collected in Wizard-of-Oz simulations we argue that the dynamic discourse representation needed for a given application can be structured in terms of a tree of dialogue objects (moves, initiativeresponse units) and a score board, i.e. a list of parameters each of which keeps some information relevant to the system's interpretation and generation tasks. We also argue that the domain knowledge needed for supporting reference resolution can, and should be obtained from data of this kind. 1
The Theory and Use of Clarification Requests in Dialogue
, 2004
"... Clarification requests are an important, relatively common and yet under-studied dialogue device allowing a user to ask about some feature (e.g. the meaning or form) of an utterance, or part thereof. They can take many different forms (often highly elliptical) and can have many different meanings (r ..."
Abstract
-
Cited by 26 (4 self)
- Add to MetaCart
Clarification requests are an important, relatively common and yet under-studied dialogue device allowing a user to ask about some feature (e.g. the meaning or form) of an utterance, or part thereof. They can take many different forms (often highly elliptical) and can have many different meanings (requesting various types of information). This thesis combines empirical, theoretical and implementational work to provide a study of the various types of clarification request that exist, give a theoretical analysis thereof, and show how the results can be applied to add useful capabilities to a prototype computational dialogue system. A series
Planning Multisentential English Text Using Communicative Acts
, 1991
"... ISSN 1476-2986Summary The goal of this research is to develop explanation presentation mechanisms for knowledge based systems which enable them to define domain terminology and concepts, narrate events, elucidate plans, processes, or propositions and argue to support a claim or advocate action. This ..."
Abstract
-
Cited by 26 (0 self)
- Add to MetaCart
(Show Context)
ISSN 1476-2986Summary The goal of this research is to develop explanation presentation mechanisms for knowledge based systems which enable them to define domain terminology and concepts, narrate events, elucidate plans, processes, or propositions and argue to support a claim or advocate action. This requires the development of devices which select, structure, order and then linguistically realize explanation content as coherent and cohesive English text. With the goal of identifying generic explanation presentation strategies, a wide range of naturally occurring texts were analyzed with respect to their communicative sttucture, function, content and intended effects on the reader. This motivated an integrated theory of communicative acts which characterizes text at the level of rhetorical acts (e.g., describe, define, narrate), illocutionary acts (e.g., inform, request), and locutionary acts (e.g., ask, command). Taken as a whole, the identified communicative acts characterize the structure, content and intended effects of four types of text: description, narration, exposition, argument. These text types have distinct effects such as getting the reader to know about entities, to know about events, to understand plans, processes, or propositions, or to believe propositions or want to perform actions. In addition to identifying the communicative function and effect of text at multiple levels
