Procedure for quantitatively comparing the syntactic coverage of English grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Towards history-based grammars: using richer models for probabilistic parsing
HLT '91 Proceedings of the workshop on Speech and Natural Language
Computational Linguistics - Special issue on using large corpora: I
A reestimation algorithm for probabilistic dependency grammars
Natural Language Engineering
A dependency-based method for evaluating broad-coverage parsers
Natural Language Engineering
Parsing the Wall Street Journal with the inside-outside algorithm
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Learning parse and translation decisions from examples with rich context
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Using bracketed parses to evaluate a grammar checking application
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A language-independent anaphora resolution system for understanding multilingual texts
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
PRINCIPAR: an efficient, broad-coverage, principle-based parser
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
An efficient implementation of a new DOP model
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
University of Manitoba: description of the NUBA system as used for MUC-5
MUC5 '93 Proceedings of the 5th conference on Message understanding
Decision tree parsing using a hidden derivation model
HLT '94 Proceedings of the workshop on Human Language Technology
A dependency-based method for evaluating broad-coverage parsers
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Semi-supervised learning of dependency parsers using generalized expectation criteria
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Learning to parse database queries using inductive logic programming
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We present an approach to grammar development where the task is decomposed into two separate subtasks. The first tasks linguistic, with the goal of producing a set of rules that have a large coverage (in the sense that the correct parse is among the proposed parses) on a blind test set of sentences. The second task is statistical, with the goal of developing a model of the grammar which assigns maximum probability for the correct parse. We give parsing results on text from computer manuals.