A parser for a speech understanding system is described. The parser uses a best-first strategy in which alternative paths are assigned priorities and paths are suspended as long as there is a higher priority alternative to explore.
Certain restrictions on possible scopings of quantified noun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form.
Existing models of plan inference (PI) in conversation have assumed that the agent whose plan is being inferred (the actor) and the agent drawing the inference (the observer) have identical beliefs about actions in the domain.
Several authors have tried to model attachment preferences for structurally ambiguous sentences, which cannot be disambiguated from semantic information. These models lack rigor and have been widely criticized.
Stuart M. Shieber, Gertjan Van Noord, Robert C. Moore, & Fernando C. N. Pereira
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithm in that it places fewer restrictions on the class of grammars to which it is applicable.
We describe the design and implementation of a general storage system that incrementally loads referenced frames from a DBMS, and save modified frames back to the DBMS, for two different FRSs: LOOM and THEO.
One of the central issues to be addressed in basing a theory of speech acts on independently motivated accounts of propositional attitudes (belief, knowledge, intentions, etc.) and action is the specification of the effects of communicative acts
We report on a mechanism for semantic and pragmatic interpretation that has been designed to take advantage of the generally compositional nature of semantic analysis, without unduly constraining the order in which pragmatic decisions are made.
