A Flexible Parser for a Linguistic Development Environment
Text Understanding in LILOG, Integrating Computational Linguistics and Artificial Intelligence, Final Report on the IBM Germany LILOG-Project
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
Stochastic attribute-value grammars
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
Forest-based statistical sentence generation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Estimators for stochastic "Unification-Based" grammars
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Dynamic programming for parsing and estimation of stochastic unification-based grammars
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A parsing: fast exact Viterbi parse selection
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
A comparison of algorithms for maximum entropy parameter estimation
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Maximum entropy estimation for feature forests
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Hybrid multilingual parsing with HPSG for SRL
CoNLL '09 Proceedings of the Thirteenth Conference on Computational Natural Language Learning: Shared Task
Speeding up LFG parsing using c-structure pruning
GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
Construction of a German HPSG grammar from a detailed treebank
GEAF '09 Proceedings of the 2009 Workshop on Grammar Engineering Across Frameworks
Chart mining-based lexical acquisition with precision grammars
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Unsupervised parse selection for HPSG
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Constraining robust constructions for broad-coverage parsing with precision grammars
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Cross-Domain Effects on Parse Selection for Precision Grammars
Research on Language and Computation
Minimally supervised domain-adaptive parse reranking for relation extraction
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
CuteForce: deep deterministic HPSG parsing
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Large-scale corpus-driven PCFG approximation of an HPSG
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Speculation and negation: Rules, rankers, and the role of syntax
Computational Linguistics
The effects of semantic annotations on precision parse ranking
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
| Hi-index | 0.00 |
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.