Parsing of partially bracketed structures for parse selection

Authors:
Mark-Jan Nederhof;Ricardo Sánchez-Sáez
Affiliations:
University of St Andrews, St Andrews, United Kingdom;Universidad Politècnica de Valencia, Valencia, Spain
Venue:
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Year:
2011

Citing 12
Cited 0

An efficient probabilistic context-free parsing algorithm that computes prefix probabilities

Computational Linguistics
An Improved Context-Free Recognizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm

Communications of the ACM
On the complexity analysis of static analyses

Journal of the ACM (JACM)
Weighted deductive parsing and Knuth's algorithm

Computational Linguistics
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
Inside-outside reestimation from partially bracketed corpora

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Parsing with treebank grammars: empirical bounds, theoretical models, and the structure of the Penn Treebank

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Some computational complexity results for synchronous context-free grammars

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Statistical approaches to computer-assisted translation

Computational Linguistics
Interactive predictive parsing

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Confidence measures for error discrimination in an interactive predictive parsing framework

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars. It is explained that the main obstacle is spurious ambiguity. The proposed solution is first described in terms of appropriately constrained synchronous grammars, and then in terms of a computational model for parsing. Experiments show the feasibility for a practical grammar.