Ambiguity resolution in a reductionistic parser
<|reference_start|>Ambiguity resolution in a reductionistic parser: We are concerned with dependency-oriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in order to optimise on the accuracy of the parser, it also is beneficial for the grammarian to have as expressive a structural representation available as possible. In a reductionistic parsing system this policy may result in considerable ambiguity in the input; however, even massive ambiguity can be tackled efficiently with an accurate parsing description and effective parsing technology.<|reference_end|>
@article{voutilainen1995ambiguity,
    title={Ambiguity resolution in a reductionistic parser},
    author={Atro Voutilainen and Pasi Tapanainen (Research Unit for Computational
  Linguistics, University of Helsinki, Finland)},
    journal={arXiv preprint arXiv:cmp-lg/9502013},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9502013},
    primaryClass={cmp-lg cs.CL}
}