Abstract
We describe here two efficient parsing algorithms for natural language texts based on an extension of recursive transition networks (RTN) called recursive transition networks with string output (RTNSO). RTNSO-based grammars can be semiautomatically built from samples of a manually built syntactic lexicon. Efficient parsing algorithms are needed to minimize the temporal cost associated to the size of the resulting networks. We focus our algorithms on the RTNSO formalism due to its simplicity which facilitates the manual construction and maintenance of RTNSO-based linguistic data as well as their exploitation.
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
Woods, W.A.: Transition network grammars for natural language analysis. Commun. ACM 13(10), 591–606 (1970)
Gross, M.: Méthodes en Syntaxe. Hermann, Paris (1975)
Gross, M.: Lexicon Grammar, pp. 244–258. Pergamon Press, Cambridge (1996)
Sastre, J.M.: HOOP: a Hyper-Object Oriented Platform for the management of linguistic databases. In: Commun. of the Lexis and Grammar Conference 2006 (2006)
Roche, E.: Analyse syntaxique transformationnelle du français par transducteurs et lexique-grammaire. PhD thesis, Université Paris 7, Paris (1993)
Nakamura, T.: Analyse automatique d’un discours spcialis au moyen de grammaires locales. In: Purnelle, G., Fairn, C., Dister, A. (eds.) JADT 2004, Louvain-la-Neuve, pp. 837–847. UCL Presses universitaires de Louvain (2004)
Silberztein, M.D.: Dictionnaires électroniques et analyse automatique de textes. Le systéme INTEX, Masson, Paris (1993)
Paumier, S.: Unitex 1.2 User Manual. Université de Marne-la-Vallée (2006)
Blanc, O., Constant, M.: Outilex, a linguistic platform for text processing. In: COLING/ACL 2006, Morristown, NJ, USA, pp. 73–76. Association for Computational Linguistics (2006)
Garrido-Alenda, A., Forcada, M.L., Carrasco, R.C.: Incremental construction and maintenance of morphological analysers based on augmented letter transducers. In: TMI 2002, pp. 53–62 (2002)
Van Noord, G.: Treatment of epsilon moves in subset construction. Comput. Linguist. 26(1), 61–76 (2000)
Fredkin, E.: Trie memory. Communications of the ACM 3(9), 490–499 (1960)
Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94–102 (1970)
Woods, W.A.: Augmented transition networks for natural language analysis. Technical report CS-1, Comput. Lab., Harvard U., Cambridge, Mass. (1969)
Aycock, J., Horspool, N.: Practical Earley Parsing. The Computer Journal 45(6), 620–630 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sastre-Martínez, J.M., Forcada, M.L. (2009). Efficient Parsing Using Recursive Transition Networks with Output. In: Vetulani, Z., Uszkoreit, H. (eds) Human Language Technology. Challenges of the Information Society. LTC 2007. Lecture Notes in Computer Science(), vol 5603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04235-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-04235-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04234-8
Online ISBN: 978-3-642-04235-5
eBook Packages: Computer ScienceComputer Science (R0)