{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:43Z","timestamp":1725492403736},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_13","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"138-147","source":"Crossref","is-referenced-by-count":1,"title":["Finite State Lazy Operations in NLP"],"prefix":"10.1007","author":[{"given":"Franck","family":"Guingne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Nicart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"13_CR1","unstructured":"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\u2013300."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/00207169908804865","volume":"72","author":"J.-M. Champarnaud","year":"1997","unstructured":"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\u2013431, 1999.","journal-title":"Intern. J. of Computer Math."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"L. Karttunen. 1994. Constructing Lexical Transducers. In The Proceedings of the Fifteenth International Conference on Computational Linguistics. Coling 94, I, pages 406\u2013411, Kyoto, Japan.","DOI":"10.3115\/991886.991957"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"L. Karttunen. 1998. The Proper Treatment of Optimality in Computational Phonology. FSMNLP\u201998. International Workshop on Finite-State Methods in Natural Language Processing, June 29\u2013July 1, 1998, pages 1\u201312, Bilkent University, Ankara, Turkey.","DOI":"10.3115\/1611533.1611534"},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","first-page":"34","volume-title":"Applications of Finite-State Transducers in Natural Language Processing","author":"L. Karttunen","year":"2000","unstructured":"L. Karttunen. 2000. Applications of Finite-State Transducers in Natural Language Processing, Lecture Notes in Computer Science,in CIAA\u20192000, S. Yu and A. Paun eds., Springer Verlag, 2088(2001), 34\u201346."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"L. Karttunen ( J-P. Chanod, G. Grefenstette, A. Schiller). 1996. Regular Expressions for Language Engineering. Natural Language Engineering 2(4) 305\u2013328.","DOI":"10.1017\/S1351324997001563"},{"key":"13_CR7","unstructured":"L. Karttunen, T. Gaal, and A. Kempe 1997. Xerox Finite-State Tool. Technical Report. Xerox Research Centre Europe, Grenoble. June 1997. Meylan, France."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"S. Kleene, Representation of events in nerve nets and finite automata, automata studies, Ann. Math. Stud., Princeton University Press 34 (1956), 3","DOI":"10.1515\/9781400882618-002"},{"key":"13_CR9","unstructured":"M. Mohri. 1996. On Some Applications of Finite-State Automata Theory to Natural Language Processing, journal of natural language engineering, 2: 61\u201380."},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0024481","volume-title":"A Rational Design for a Weighted Finite-State Transducer Library","author":"M. Mohri","year":"1997","unstructured":"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\u2019 97). volume 1436 of Lecture Notes in Computer Science, pages 144\u2013158. Springer-Verlag, Berlin-NY, September."},{"key":"13_CR11","unstructured":"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\u2013140, Snowbird, UT."},{"key":"13_CR12","unstructured":"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\u201361. Proceedings of a workshop sponsored by the Association for Computational Linguistics, Madrid, Spain, July 1997"},{"key":"13_CR13","unstructured":"S. Eilenberg. 1974. Automata, Languages and Machines, Volume A."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T02:53:00Z","timestamp":1587955980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}