Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars

Simple item page
dc.creatorCarroll, John
dc.date1994-05-31
dc.date.accessioned2026-07-07T09:09:17Z
dc.date.available2026-07-07T09:09:17Z
dc.descriptionThe paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parsers.
dc.description8 pages, LaTeX source (one figure not included) To appear in ACL-94
dc.identifierhttps://arxiv.org/abs/cmp-lg/9405033
dc.identifierhttp://arxiv.org/abs/cmp-lg/9405033
dc.identifier32nd Annual Meeting of the ACL, 287-294
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/150984
dc.subjectComputation and Language
dc.titleRelating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
dc.typetext

Files

Collections

arXiv