A better N-best list

Jonathan May, Kevin Knight

Abstract

Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This redundancy leads to misrepresentation of tree weight and reduced information for debugging and tuning purposes. It is chiefly due to nondeterminism in the weighted automata that produce the results. We introduce an algorithm that determinizes such automata while preserving proper weights, returning the sum of the weight of all multiply derived trees. We also demonstrate our algorithm's effectiveness on two large-scale tasks.
BibTeX
@inproceedings{may2006better,
  author = {Jonathan May and Kevin Knight},
  title = {{A better <i>N</i>-best list}},
  booktitle = {Conference of the North American Chapter of the Association for Computational Linguistics},
  year = {2006},
  url = {https://openreview.net/forum?id=HkNMeQb_ZB},
}

Loading related content...

Figure