File(s) not publicly available
Efficiency in unification-based n-best parsing
presentation
posted on 2023-06-08, 07:07 authored by Yi Zhang, Stephan Oepen, John CarrollWe 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.
History
Publication status
- Published
Publisher
Association for Computational LinguisticsPage range
48-59Pages
12.0Presentation Type
- paper
Event name
Tenth International Conference on Parsing TechnologiesEvent location
Prague, Czech RepublicEvent type
conferenceISBN
978-1-932432-90-9Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC