Efficient Normal-Form Parsing for Combinatory Categorial Grammar

Details Efficient Normal-Form Parsing for Combinatory Categorial Grammar Efficient Normal-Form Parsing for Combinatory Categorial Grammar

1996-06-02

arxiv.org/abs/cmp-lg/9605038v1

Proceedings of ACL '96 (34th Meeting of the Association for Computational Linguistics), Santa Cruz

Computer Science

Computation and Language

8 pages, LaTeX packaged with three .sty files, also uses cgloss4e.sty

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Normal-Form Parsing for Combinatory Categorial Grammar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Normal-Form Parsing for Combinatory Categorial Grammar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Normal-Form Parsing for Combinatory Categorial Grammar will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172488