Ambiguity resolution in a reductionistic parser
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Constraint grammar as a framework for parsing running text
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Annotating 200 million words: the Bank of English project
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Finite-state parsing and disambiguation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Supertagging: an approach to almost parsing
Computational Linguistics
Tagging accurately: don't guess if you know
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
A non-projective dependency parser
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
A syntax-based part-of-speech analyser
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Annotating 200 million words: the Bank of English project
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Disambiguation of morphological analysis in Bantu languages
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
A tagger/lemmatiser for Dutch medical language
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
A language--independent shallow--parser compiler
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
The present use of statistics in the evaluation of NLP parsers
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
Coupling a linguistic formalism and a script language
CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
| Hi-index | 0.00 |
We are concerned with the syntactic annotation of unrestricted text. We combine a rule-based analysis with subsequent exploitation of empirical data. The rule-based surface syntactic analyser leaves some amount of ambiguity in the output that is resolved using empirical patterns. We have implemented a system for generating and applying corpus-based patterns. Some patterns describe the main constituents in the sentence and some the local context of the each syntactic function. There are several (partly) reduntant patterns, and the "pattern" parser selects analysis of the sentence that matches the strictest possible pattern(s). The system is applied to an experimental corpus. We present the results and discuss possible refinements of the method from a linguistic point of view.