Sciweavers

ACL
1990
14 years 10 hour ago
A Compositional Semantics for Focusing Subjuncts
A compositional semantics for focusing subjuncts-words such as only, even, and also--is developed from Rooth's theory of association with focus. By adapting the theory so tha...
Daniel Lyons, Graeme Hirst
ACL
1990
14 years 10 hour ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
ACL
1990
14 years 10 hour ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen
ACL
1990
14 years 10 hour ago
Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
Mark Johnson
ACL
1990
14 years 10 hour ago
The Limits of Unification
Current complex-feature based grammars use a single procedure--unification--for a multitude of purposes, among them, enforcing formal agreement between purely syntactic features. ...
Robert Ingria
ACL
1990
14 years 10 hour ago
Noun Classification from Predicate-Argument Structures
A method of determining the similarity of nouns on the basis of a metric derived from the distribution of subject, verb and object in a large text corpus is described. The resulti...
Donald Hindle
ACL
1990
14 years 10 hour ago
Designer Definites in Logical Form
In this paper, we represent singular definite noun phrases as functions in logical form. This representation is designed to model the behaviors of both anaphoric and non-anaphoric...
Mary P. Harper
ACL
1990
14 years 10 hour ago
Normal State Implicature
In the right situation, a speaker can use an unqualified indefinite description without being misunderstood. This use of language, normal slate implicature, is a kind of conversat...
Nancy Green
ACL
1990
14 years 10 hour ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
ACL
1990
14 years 10 hour ago
Memory Capacity and Sentence Processing
The limited capacity of working memory is intrinsic to human sentence processing, and therefore must be addressed by any theory of human sentence processing. This paper gives a th...
Edward Gibson