Counting Coordination Categorially

dc.creatorCremers, Crit
dc.creatorHijzelendoorn, Maarten
dc.date1996-05-06
dc.date1996-05-07
dc.date.accessioned2026-07-07T09:02:20Z
dc.date.available2026-07-07T09:02:20Z
dc.descriptionThis 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.
dc.description7 pages, PostScript
dc.identifierhttps://arxiv.org/abs/cmp-lg/9605011
dc.identifierhttp://arxiv.org/abs/cmp-lg/9605011
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/148596
dc.subjectComputation and Language
dc.titleCounting Coordination Categorially
dc.typetext

Files

Collections