Paper: Parsing Conjunctions Deterministically

ACL ID P86-1013
Title Parsing Conjunctions Deterministically
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1986

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, walt-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.