Abstract
Finite state networks can represent dictionaries and lexical relations. Traditional finite-state operations like composition can produce huge networks with prohibitive computation space and time. For a subset of finite state operations, these drawbacks can be avoided by using virtual networks, which rely on structures that are partially built on demand. This paper addresses the implementation of virtual network operations in xfst (XEROX Finite State Technology software). The example of “priority union” which is particularly useful in NLP, is developed.
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
A. V. Aho. 1990. Algorithms for Finding Patterns in Strings, in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity, (J. van Leeuwen, ed.), Elsevier, 255–300.
J.-M. Champarnaud, J.-L. Ponty and D. Ziadi. 1997. From a regular expression to an automaton, Intern. J. of Computer Math., Vol. 72, 415–431, 1999.
L. Karttunen. 1994. Constructing Lexical Transducers. In The Proceedings of the Fifteenth International Conference on Computational Linguistics. Coling 94, I, pages 406–411, Kyoto, Japan.
L. Karttunen. 1998. The Proper Treatment of Optimality in Computational Phonology. FSMNLP’98. International Workshop on Finite-State Methods in Natural Language Processing, June 29–July 1, 1998, pages 1–12, Bilkent University, Ankara, Turkey.
L. Karttunen. 2000. Applications of Finite-State Transducers in Natural Language Processing, Lecture Notes in Computer Science,in CIAA’2000, S. Yu and A. Paun eds., Springer Verlag, 2088(2001), 34–46.
L. Karttunen ( J-P. Chanod, G. Grefenstette, A. Schiller). 1996. Regular Expressions for Language Engineering. Natural Language Engineering 2(4) 305–328.
L. Karttunen, T. Gaal, and A. Kempe 1997. Xerox Finite-State Tool. Technical Report. Xerox Research Centre Europe, Grenoble. June 1997. Meylan, France.
S. Kleene, Representation of events in nerve nets and finite automata, automata studies, Ann. Math. Stud., Princeton University Press 34 (1956), 3
M. Mohri. 1996. On Some Applications of Finite-State Automata Theory to Natural Language Processing, journal of natural language engineering, 2: 61–80.
M. Mohri, F. C. N. Pereira, and M. Riley. A Rational Design for a Weighted Finite-State Transducer Library. In Derick Wood and Sheng Yu, editors, Proceedings of the Second InternationalWorkshop on Implementing Automata (WIA’ 97). volume 1436 of Lecture Notes in Computer Science, pages 144–158. Springer-Verlag, Berlin-NY, September.
M. Riley, F. Pereira, and E. Chun. 1995., Lazy transducer composition: a flexible method for on-the-fly expansion of context dependent grammar networks, in IEEE Automatic Speech Recognition Workshop, pages 139–140, Snowbird, UT.
R. M, Kaplan. and P. Newman. 1997. Lexical resource reconciliation in the Xerox Linguistic Environment. In D. Estival, A. Lavelli, K. Netter, and F. Pianesi (editors), Computational environments for grammar development and linguistic engineering, pp. 54–61. Proceedings of a workshop sponsored by the Association for Computational Linguistics, Madrid, Spain, July 1997
S. Eilenberg. 1974. Automata, Languages and Machines, Volume A.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guingne, F., Nicart, F. (2003). Finite State Lazy Operations in NLP. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive