Procedure for quantitatively comparing the syntactic coverage of English grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
Natural language parsing as statistical pattern recognition
Natural language parsing as statistical pattern recognition
Empirical methods for artificial intelligence
Empirical methods for artificial intelligence
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
PCFG models of linguistic tree representations
Computational Linguistics
Stochastic attribute-value grammars
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Three generative, lexicalised models for statistical parsing
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
On interpreting f-structures as UDRSs
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
A lexical functional grammar system in PROLOG
COLING '86 Proceedings of the 11th coference on Computational linguistics
Direct and underspecified interpretations of LFG f-structures
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
More accurate tests for the statistical significance of result differences
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
The Penn Chinese TreeBank: Phrase structure annotation of a large corpus
Natural Language Engineering
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
Using grammatical relations to compare parsers
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
High precision extraction of grammatical relations
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
A simple pattern-matching algorithm for recovering empty nodes and their antecedents
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Generative models for statistical parsing with Combinatory Categorial Grammar
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Parsing with generative models of predicate-argument structure
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Antecedent recovery: experiments with a trace tagger
EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing
Identifying semantic roles using Combinatory Categorial Grammar
EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Large-scale induction and evaluation of lexical resources from the Penn-II treebank
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Deep linguistic analysis for the accurate identification of predicate-argument relations
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Evaluating the accuracy of an unlexicalized statistical parser on the PARC DepBank
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Design of a multi-lingual, parallel-processing statistical parsing engine
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Adding predicate argument structure to the Penn TreeBank
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Maximum entropy estimation for feature forests
HLT '02 Proceedings of the second international conference on Human Language Technology Research
A dependency-based method for evaluating broad-coverage parsers
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Evaluating machine translation with LFG dependencies
Machine Translation
Automatic treebank-based acquisition of Arabic LFG dependency structures
Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
Improving data-driven dependency parsing using large-scale LFG grammars
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
DEPEVAL(summ): dependency-based evaluation for automatic summaries
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
Dublin city university at QA@CLEF 2008
CLEF'08 Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access
Rebanking CCGbank for improved NP interpretation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Hard constraints for grammatical function labelling
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Better hypothesis testing for statistical machine translation: controlling for optimizer instability
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
CuteForce: deep deterministic HPSG parsing
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Cross-framework evaluation for statistical parsing
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Robust conversion of CCG derivations to phrase structure trees
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
Hi-index | 0.00 |
A number of researchers have recently conducted experiments comparing deep hand-crafted wide-coverage with shallow treebank-and machine-learning-based parsers at the level of dependencies, using simple and automatic methods to convert tree output generated by the shallow parsers into dependencies. In this article, we revisit such experiments, this time using sophisticated automatic LFG f-structure annotation methodologies with surprising results. We compare various PCFG and history-based parsers to find a baseline parsing system that fits best into our automatic dependency structure annotation technique. This combined system of syntactic parser and dependency structure annotation is compared to two hand-crafted, deep constraint-based parsers, RASP and XLE. We evaluate using dependency-based gold standards and use the Approximate Randomization Test to test the statistical significance of the results. Our experiments show that machine-learning-based shallow grammars augmented with sophisticated automatic dependency annotation technology outperform hand-crafted, deep, wide-coverage constraint grammars. Currently our best system achieves an f-score of 82.73% against the PARC 700 Dependency Bank, a statistically significant improvement of 2.18% over the most recent results of 80.55% for the hand-crafted LFG grammar and XLE parsing system and an f-score of 80.23% against the CBS 500 Dependency Bank, a statistically significant 3.66% improvement over the 76.57% achieved by the hand-crafted RASP grammar and parsing system.