Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
<|reference_start|>Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars: The 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.<|reference_end|>
@article{carroll1994relating,
    title={Relating Complexity to Practical Performance in Parsing with
  Wide-Coverage Unification Grammars},
    author={John Carroll (University of Cambridge, Computer Laboratory)},
    journal={32nd Annual Meeting of the ACL, 287-294},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9405033},
    primaryClass={cmp-lg cs.CL}
}