Improving Inter-level Communication in Cascaded Finite-State Partial Parsers
An improved inter-level communication strategy that enhances the capabilities of cascaded finite-state partial parsing systems is presented. Cascaded automata are allowed to make forward calls to other automata in the cascade as well as backward references to previously identified groupings. The approach is more powerful than a design in which the output of the current level is simply passed to the next level in the cascade. The approach is evaluated on randomly extracted sentences from the Encarta encyclopedia. A discussion of related research is also presented.
KeywordsNoun Phrase Relative Clause Prepositional Phrase Subordinate Clause Input Sentence
Unable to display preview. Download preview PDF.
- 1.Abney, S.: Partial parsing via finite-state cascades. In: Proceedings of the ESSLLI 1996 Robust Parsing Workshop (1996)Google Scholar
- 4.Daelemans, W., Buchholz, S., Veenstra, J.: Memory-based shallow parsing. In: Proceedings of the 3rd Conference on Natural Language Learning (1999)Google Scholar
- 5.Li, X., Roth, D.: Exploring evidence for shallow parsing. In: Proceedings of the 5th Conference on Natural Language Learning, pp. 38–44 (2001)Google Scholar
- 6.Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a large annotated corpus of english: the Penn Treebank. Computational Linguistics 19(2), 313–330 (1993)Google Scholar
- 7.Munoz, M., Punyakanok, V., Roth, D., Zimak, D.: A learning approach to shallow parsing. In: Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora, pp. 168–178 (1999)Google Scholar
- 9.van Delden, S., Gomez, F.: A larger-first approach to partial parsing. In: Proceedings of the 2003 International Conference on Recent Advances in Natural Language Processing, pp. 124–131 (2003)Google Scholar
- 10.van den Bosch, A., Buchholz, S.: Shallow parsing on the basis of words alone: A case study. In: Proceedings of the 40th Annual Meeting of the Association of Computation Linguistics, pp. 433–440 (2002)Google Scholar