Computer Science – Computation and Language
Scientific paper
1996-05-06
Computer Science
Computation and Language
7 pages, PostScript
Scientific paper
This paper presents a way of reducing the complexity of parsing free coordination. It lives on the Coordinative Count Invariant, a property of derivable sequences in occurrence-sensitive categorial grammar. This invariant can be exploited to cut down deterministically the search space for coordinated sentences to minimal fractions. The invariant is based on inequalities, which is shown to be the best one can get in the presence of coordination without proper parsing. It is implemented in a categorial parser for Dutch. Some results of applying the invariant to the parsing of coordination in this parser are presented.
Cremers Crit
Hijzelendoorn Maarten
No associations
LandOfFree
Counting Coordination Categorially 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 Counting Coordination Categorially, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Coordination Categorially will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-597622