Foundations of statistical natural language processing
Foundations of statistical natural language processing
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
High precision extraction of grammatical relations
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Intricacies of Collins' Parsing Model
Computational Linguistics
Probabilistic disambiguation models for wide-coverage HPSG parsing
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
The importance of supertagging for wide-coverage CCG parsing
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Efficient extraction of grammatical relations
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
The second release of the RASP system
COLING-ACL '06 Proceedings of the COLING/ACL on Interactive presentation sessions
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Statistical Parsing with Context-Free Filtering Grammar
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Constructing a parser evaluation scheme
CrossParser '08 Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
Partial parse selection for robust deep processing
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Porting a lexicalized-grammar parser to the biomedical domain
Journal of Biomedical Informatics
Comparing the accuracy of CCG and Penn Treebank parsers
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Wide-coverage parsing of speech transcripts
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Computational Linguistics
Faster parsing by supertagger adaptation
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Topic models for word sense disambiguation and token-based idiom detection
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Exploiting CCG structures with tree kernels for speculation detection
CoNLL '10: Shared Task Proceedings of the Fourteenth Conference on Computational Natural Language Learning --- Shared Task
Linguistic cues for distinguishing literal and non-literal usages
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Chart pruning for fast lexicalised-grammar parsing
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Cross-Domain Effects on Parse Selection for Precision Grammars
Research on Language and Computation
Parsing noun phrases in the penn treebank
Computational Linguistics
Parser evaluation using elementary dependency matching
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Get out but don't fall down: verb-particle constructions in child language
Proceedings of the Workshop on Computational Models of Language Acquisition and Loss
Dependency hashing for n-best CCG parsing
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
| Hi-index | 0.00 |
We evaluate the accuracy of an unlexicalized statistical parser, trained on 4K treebanked sentences from balanced data and tested on the PARC DepBank. We demonstrate that a parser which is competitive in accuracy (without sacrificing processing speed) can be quickly tuned without reliance on large in-domain manually-constructed treebanks. This makes it more practical to use statistical parsers in applications that need access to aspects of predicate-argument structure. The comparison of systems using DepBank is not straightforward, so we extend and validate DepBank and highlight a number of representation and scoring issues for relational evaluation schemes.