ACL
1989
13 years 6 months ago
1989
ACL
1989
13 years 6 months ago
1989
ACL
1989
13 years 6 months ago
1989
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
ACL
1989
13 years 6 months ago
1989
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...
ACL
1989
13 years 6 months ago
1989
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...
ACL
1989
13 years 6 months ago
1989
Existing plan-based theories of speech act interpretation do not account for the conventional aspect of speech acts. We use patterns of linguistic features (e.g. mood, verb form, ...
ACL
1989
13 years 6 months ago
1989
An effective procedure for automatically acquiring a new set of disambiguation rules for an existing deterministic parser on the basis of tagged text is presented. Performance of ...
ACL
1989
13 years 6 months ago
1989
Parsing with categorial grammars often leads to problems such as proliferating lexical ambiguity, spurious parses and overgeneration. This paper presents a parser for French devel...
ACL
1989
13 years 6 months ago
1989
We present a general treatment of the comparative that is based on more basic linguistic elements so that the underlying system can be effectively utilized: in the syntactic analy...
ACL
1989
13 years 6 months ago
1989
Feature structures are informational elements that have been used in several linguistic theories and in computational systems for natural-language processing. A logicaJ calculus h...