Articles

The structure of problem-solving discourse in the expert advising setting can be modeled by adding a layer of metaplans to a plan-based model of the task domain. Classes of metaplans are introduced to model both the agent's gradual refinement and instantiation of a domain plan for a task and the …...

In this paper a method for controlling the dialog in a natural language (NL) system is presented. It provides a deep modeling of information processing based on time dependent propositional attitudes of the interacting agents. Knowledge about the state of the dialog is represented in a dedicated language and changes …...

It is a tacit assumption of much linguistic inquiry that all distinct derivations of a string should assign distinct meanings. But despite the tidiness of such derivational uniqueness, there seems to be no a pri- ori reason to assume that a gramma r must have this property. If a grammar …...

This paper presents a constraint logic programming language cu-Prolog and introduces a simple Japanese parser based on Japanese Phrase Structure Grammar (JPSG) as a suitable application of cu-Prolog. cu-Prolog adopts constraint unification instead of the normal Prolog unification. In cu-Prolog, con- straints in terms of user defined predicates can be …...

To account for the semi-free word order of French, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Second, type-raised NP's are described as two-sided functors. The new framework does not overgenerate i.e., it accepts all and only …...

Theoretical research in the area of machine translation usu- ally involves the search for and creation of an appropriate formalism. An important issue in this respect is the way in which the compositionality of translation is to be defined. In this paper, we will introduce the anaphoric component of the …...

We present the results from a series of ex- periments aimed at uncovering the discourse structure of man-machine communication in nat- ural language (Wizard of Oz experiments). The results suggest the existence of different classes of dialogue situations, requiring computational discourse representations of various complexity. Important factors seem to be …...

S OF CURRENT LITERATURE Selected Dissertation Abstracts Compiled by: Susanne M. Humphrey National Library of Medicine Bethesda, MD 208!)4 Bob Krovetz University of Massachusetts Amherst, MA 0100.2 The following are citations selected by title and abstract as being related to computational linguistics or knowledge representation, resulting from a computer search, …...

Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spu- rious parses and overgeneration. This paper presents a parser for French developed on an unification based categorial grammar (FG) which avoids these pro- blem s. This parser is a bottom-up c hart parser augmen- ted with …...

The logic behind parsers for categorial grammars can be formalized in several different ways. Lam- bek Calculus (LC) constitutes an example for a na- tural deduction 1 style parsing method. In natural language processing, the task of a parser usually consists in finding derivations for all different readings of a …...

the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. …...

In order to take steps towards establishing a method- ology for evaluating Natural Language systems, we conducted a case study. We attempt to evaluate two different approaches to anaphoric processing in dis- course by comparing the accuracy and coverage of two published algorithms for finding the co-specifiers of pronouns in …...

This paper addresses issues that arose in apply- ing the model for discourse entity (DE) generation in B. Webber's work (1978, 1983) to an interactive multi- modal interface. Her treatment was extended in 4 areas: (1)the notion of context dependence of DEs was formalized in an intensional logic, (2)the treat- …...

In this paper the functional uncertainty machin- ery in LFG is compared with the treatment of long distance dependencies in TAG. It is shown that the functional uncertainty machinery is redundant in TAG, i.e., what functional uncertainty accom- plishes for LFG follows f~om the TAG formalism itself and some aspects …...

Tree Unification Grammar is a declarative unification-bas~:l linguistic framework. The basic grammar stmaures of this framework are partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions. Using this framework, constraints associated with various linguistic phenomena (reflexivisation in particular) ~ be stated …...

Explanation is an interactive process re- quiring a dialogue between advice-giver and advice-seeker. In this paper, we argue that in order to participate in a dialogue with its users, a generation system must be capable of reasoning about its own utterances and there- fore must maintain a rich representation of …...

In BBN's natural language understanding and generation system (Janus), we have used a hybrid approach to representation, employing an intensional logic for the representation of the semantics of ut- terances and a taxonomic language with formal semantics for specification of descriptive constants and axioms relating them. Remarkably, 99.9% of 7,000 …...

This paper addresses the problem of developing a large semantic lexicon for natural language processing. The increas~g availability of machine readable documents offers an opportunity to the field of lexieal semantics, by providing experimental evidence of word uses (on-line texts) and word definitions (on-line dictionaries). The system presented hereafter, PETRARCA, …...

We present a general treatment of the com- parative that is based on more basic linguistic elements so that the underlying system can be effectively utilized: in the syntactic analy- sis phase, the comparative is treated the same as similar structures; in the syntactic regular- ization phase, the comparative is …...

The Context-Free backbone of some natural language ana- lyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disam- biguation process that may be based on the finer features of the language. We study the structure of …...