The KERNEL text understanding system
Artificial Intelligence - Special volume on natural language processing
Light parsing as finite state filtering
Extended finite state models of language
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
SCIE '97 International Summer School on Information Extraction: A Multidisciplinary Approach to an Emerging Information Technology
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
From grammar to lexicon: unsupervised learning of lexical syntax
Computational Linguistics - Special issue on using large corpora: II
A lightweight dependency analyzer for partial parsing
Natural Language Engineering
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Assigning function tags to parsed text
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Using semantic preferences to identify verbal participation in role switching alternations
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Automatic extraction of subcategorization from corpora
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
A memory-based approach to learning shallow natural language patterns
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Automatic identification of non-compositional phrases
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
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
Parse forest computation of expected governors
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Class-based probability estimation using a semantic hierarchy
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
An unsupervised approach to prepositional phrase attachment using contextually similar words
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Using existing systems to supplement small amounts of annotated grammatical relations training data
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
A parsing system returning analyses in the form of sets of grammatical relations can obtain high precision if it hypothesises a particular grammatical relation only when it is certain that the relation is correct. We operationalise this technique -in a statistical parser using a manually-developed wide-coverage grammar of English - by only returning relations that form part of all analyses licensed by the grammar. We observe an increase in precision from 75% to over 90% (at the cost of a reduction in recall) on a test corpus of naturally-occurring text.