Efficiency in unification-based n-best parsing

Zhang, Yi, Oepen, Stephan and Carroll, John (2007) Efficiency in unification-based n-best parsing. In: Tenth International Conference on Parsing Technologies, Prague, Czech Republic.

Full text not available from this repository.


We extend a recently proposed algorithm for n-best unpacking of parse forests to deal efficiently with (a) Maximum Entropy (ME) parse selection models containing important classes of non-local features, and (b) forests produced by unification grammars containing significant proportions of globally inconsistent analyses. The new algorithm empirically exhibits a linear relationship between processing time and the number of analyses unpacked at all degrees of ME feature non-locality; in addition, compared with agenda-driven best-first parsing and exhaustive parsing with post-hoc parse selection it leads to improved parsing speed, coverage, and accuracy.

Item Type: Conference or Workshop Item (Paper)
Schools and Departments: School of Engineering and Informatics > Informatics
Depositing User: John Carroll
Date Deposited: 06 Feb 2012 20:38
Last Modified: 12 Apr 2012 12:34
URI: http://srodev.sussex.ac.uk/id/eprint/27136
📧 Request an update