Semantic interpretation and the resolution of ambiguity
Semantic interpretation and the resolution of ambiguity
Theory of Syntactic Recognition for Natural Languages
Theory of Syntactic Recognition for Natural Languages
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
Treating coordination in logic grammars
Computational Linguistics
Dealing with conjunctions in a machine translation environment
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
New approaches to parsing conjunctions using prolog
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Analysis of conjunctions in a rule-based parser
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Symmetric pattern matching analysis for English coordinate structures
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
When something is missing: ellipsis, coordination and the chart
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
| Hi-index | 0.00 |
Conjunctions have always been a source of problems for natural language parsers. This paper shows how these problems may be circumvented using a rule-based, wait-and-see parsing strategy. A parser is presented which analyzes conjunction structures deterministically, and the specific rules it uses are described and illustrated. This parser appears to be faster for conjunctions than other parsers in the literature and some comparative timings are given.