Abstract
Robust analysis covers not only processing partially ungrammatical input (Carbonell & Hayes 1983, Weng 1993), but more generally unrestricted text as actually produced by end-users in various situations.
While early work in robust analysis dates back to the seventies, the topic has recently gained broader attention, due to the large quantities of textual data now available in electronic form (e.g. technical documentation, news, web pages, email, voice system).
This article first introduces the notion of robust parsing in natural language processing. It then reviews a series of linguistic phenomena that illustrate the need for specific approaches to robust parsing. Finally, it mentions some of pioneer and recent work in robust parsing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abney, S. (1991). Parsing by chunks, in R. Berwick, S. Abney and C. Tenny (eds), Principled-Based Parsing, Kluwer Academic Publishers, Dordrecht, pp. 257–278.
At Mokhtar, S. and Chanod, J.-P (1997a). Incremental finite-state parsing, Proceedings of Applied Natural Language Processing, Washington, DC, pp. 72–79.
Aft Mokhtar, S. and Chanod, J.-P. (1997b). Subject and object dependency extraction using finite-state transducers, ACL Workshop on Automatic Information Extraction and Building of Lexical Semantic Resources for NLP Applications, Madrid.
Berwick, R. (1991). Principles of principled-based parsing, in R. Berwick, S. Abney and C. Tenny (eds), Principled-Based Parsing, Kluwer Academic Publishers, pp. 1–37.
Briscoe, T. and N. Waegner, N. (1992). Robust stochastic parsing using the inside-outside algorithm, AAAI Workshop on Probabilistically-Based Natural Language Processing Techniques, pp. 3953.
Brown, P, Della-Pietra, J., Jelinek, F., Mercer, R. and Roossin, P. (1988). A statistical approach to language translation, Twelfth Conference on Computational Linguistics, Budapest, pp. 7176.
Brun, C. (1998): Étude et implantation de la coordination en vue de l’analyse automatique du français écrit dans le cadre de la Grammaire Lexicale Fonctionnelle,Doctorat en informatique et communication.
Carbonell, J. G. and Hayes, P J. (1983). Recovery strategies for parsing extragrammatical language, American Journal of Computational Linguistics 9 (3–4): 123–146.
Chanod, J.-P and Tapanainen, P. (1996). Finite-state based reductionist parsing for French, in A. Kornai (ed.), Extended Finite State Models of Language, Cambridge University Press, pp. 72–85.
Charniak, E. (1993). Statistical Language Learning, The MIT Press, Cambridge, MA.
Chomsky, N. (1981). Markedness and core grammar, in A. Belletti, L. Brandi and L. Rizzi (eds), Theory of Markedness in Generative Grammar, Proceedings of the 1979 GLOW Conference, Scuola Normale Superiore di Pisa, Pisa.
Church, K. (1988). A stochastic parts program and noun phrase parser for unrestricted text, Proceedings of the Second Conference on Applied NLP, ACL, Austin, pp. 136–143.
Cutting, D., Kupiec, J., Pedersen, J. and Sibun, P (1992). A practical part-of-speech tagger, ANLP-92, Trento, pp. 133–140.
Ejerhed, E. (1988). Finding clauses in unrestricted text by finitary and stochastic methods, 2nd Conference on Applied Natural Language Processing, ACL, Texas, pp. 133–140.
Ejerhed, E. (1993). Nouveaux courants en analyse syntaxique, Traitement automatique des langues 34 (1): 61–82.
Federici, S., Montemagni, S. and Pirrelli, V. (1996). Shallow parsing and text chunking: A view on underspecification in syntax, ESSLLI’96 Workshop on Robust Parsing, Prague, pp. 35–44.
Garside, R., Leech, G. and Sampson, G. (eds) (1987). The Computational Analysis of English: A Corpus-Based Approach, Longman, London.
Gazdar, Klein, Pullum and Sag (1985). Generalized Phrase Structure Grammar,Harvard University Press.
Grefenstette, G. (1996). Light parsing as finite-state filtering, Proceedings ECAI’96 Workshop on Extended Finite-State Models of Language, Budapest, pp. 20–25.
Heidorn, G. (1975). Augmented phrase-structure grammars, in R. Shank and B. Nash-Webber (eds), Theoretical Issues in Natural Language Processing, Association for Computational Linguistics.
Heidorn, G. (1982). Experience with an easily computed metric for ranking alternative parses,20th Annual Meeting of the ACL, Toronto, pp. 82–84.
Hindle, D. (1983). User manual for Fidditch, Technical memorandum 7590–142, Naval Research Laboratory.
Hobbs, J., Appelt, D., Bear, J., Israel, D., Kameyama, M. and Tyson, M. (1993). FASTUS. a system for extracting information from text, Proceedings, Human Language Technology, Princeton, New Jersey, pp. 133–137.
Jâszó, A. (1994). A Magyar Nyelv Könyve, Trezor Kiadó, Budapest.
Jensen, K. (1988). Why computational grammarians can be skeptical about existing linguistic theories, COLING, Budapest, pp. 448–449.
Jensen, K., Heidorn, G. and Richardson, S. (eds) (1992). Natural Language Processing: The PLNLP Approach,Kluwer Academic Publishers.
Jensen, K, Heidom, G., Richardson, S. and Haas, N. (1986). PLNLP, PEG and CRITITQUE: Three contributions to computing in the humanities, Proceedings of the 8th International Conference on Computers and the Humanities, Toronto.
Joshi, A., Levy L. and Takahashi, M. (1975). Tree adjoining grammar, Journal of the Computer and System Science 10 (1).
Kaplan, R. and Bresnan, J. (1982). Lexical functional grammar: A formal system for grammatical representation, in J. Bresnan (ed.), The Mental Representation of Grammatical Relations, The MIT Press, Cambridge, MA, pp. 173–282.
Karlsson, E (1990). Constraint grammar as a framework for parsing running text, 13th Conference on Computational Linguistics, Helsinki, pp. 168–173.
Koskenniemi, K., Tapanainen, P and Voutilainen, A. (1992). Compiling and using finite-state syntactic rules, Proceedings of the Fourteenth International Conference on Computational Linguistics COLING, Nantes, pp. 156–162.
Nagao, M. (1992). Are the grammars so far developed appropriate to recognize the real structure of a sentence?, Fourth International Conference on Theoretical and Methodological Issues in Machine Translation, Montreal, pp. 127–137.
Shaumyan, S. and Segond, E (1992). Discontinuous constructions and applicative universal grammar, MOL3 (Mathematics of Language) conference, Austin, Texas.
Steedman, M. (1990). Gaping as constituent coordination, Linguistics and Philosophy 13: 207–263.
Swan, M. (1980). Practical English Usage,Oxford University Press.
Voutilainen, A. and Tapanainen, P. (1993). Ambiguity resolution in a reductionistic parser, Proceedings of the Sixth Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, pp. 394–403.
Weng, E L. (1993). Handling syntactic extra-grammaticality, Proceedings of the 3rd International Workshop on Parsing Technologies, Tilburg, pp. 319–332.
Wilks, Y. (1993). Corpora and machine translation, Proceedings of Machine Translation Summit IV, Kobe.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Chanod, JP. (2001). Robust Parsing and Beyond. In: Junqua, JC., van Noord, G. (eds) Robustness in Language and Speech Technology. Text, Speech and Language Technology, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9719-7_8
Download citation
DOI: https://doi.org/10.1007/978-94-015-9719-7_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5643-6
Online ISBN: 978-94-015-9719-7
eBook Packages: Springer Book Archive