Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
An algorithm for generating quantifier scopings
Computational Linguistics
Prolog and natural-language analysis
Prolog and natural-language analysis
Programming in Prolog
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Grammar, interpretation, and processing from the lexicon
Lexical representation and process
Categorial semantics and scoping
Computational Linguistics
Anaphora and the Logic of Change
JELIA '90 Proceedings of the European Workshop on Logics in AI
An integrated framework for semantic and pragmatic interpretation
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Discourse, anaphora and parsing
COLING '86 Proceedings of the 11th coference on Computational linguistics
Semantic abstraction and anaphora
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
The construction of the semantic representation for a natural language sentence or a piece of discourse cannot be covered by the so-called "compositional semantics" alone. In the general case, the non-compositional construction steps of generating quantifier scoping and of anaphora resolution have to be included. In order to filter out unnecessary information as soon as possible it is desirable to merge these three phases into one processing step. We describe how the rules for "extended compositional semantics" as presented in ([Pereira, 1990]) can be integrated into a parser for categorial grammar. The inspection of the data flow shows where concurrency can come into play.