A divide-and-conquer strategy for shallow parsing of German free texts
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
An annotation scheme for free word order languages
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
An information extraction core system for real world German text processing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Partial parsing via finite-state cascades
Natural Language Engineering
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Robust German noun chunking with a probabilistic context-free grammar
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Applying system combination to base noun phrase identification
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A cascaded finite-state parser for German
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2
Combining deep and shallow approaches in parsing German
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Text analysis meets computational lexicography
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
An implementation of combined partial parser and morphosyntactic disambiguator
ACL '07 Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop
Hi-index | 0.00 |
The paper describes a method to process recursive noun phrases with finite-state cascades. It is shown that chunking of recursive noun phrases necessitates a readjustment of the finite-state cascades approach. In particular, the property of monotonicity must be given up. Furthermore, the paper explores the influence of POS tags and online agreement checking on the overall performance.