Efficient Normal-Form Parsing for Combinatory Categorial Grammar
| dc.creator | Eisner, Jason | |
| dc.date | 1996-06-02 | |
| dc.date.accessioned | 2026-07-07T09:10:20Z | |
| dc.date.available | 2026-07-07T09:10:20Z | |
| dc.description | Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This paper addresses the problem for a fairly general form of Combinatory Categorial Grammar, by means of an efficient, correct, and easy to implement normal-form parsing technique. The parser is proved to find exactly one parse in each semantic equivalence class of allowable parses; that is, spurious ambiguity (as carefully defined) is shown to be both safely and completely eliminated. | |
| dc.description | 8 pages, LaTeX packaged with three .sty files, also uses cgloss4e.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605038 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605038 | |
| dc.identifier | Proceedings of ACL '96 (34th Meeting of the Association for Computational Linguistics), Santa Cruz | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151323 | |
| dc.subject | Computation and Language | |
| dc.title | Efficient Normal-Form Parsing for Combinatory Categorial Grammar | |
| dc.type | text |