{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:17:38Z","timestamp":1740374258801,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146831"},{"type":"electronic","value":"9783642146848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14684-8_4","type":"book-chapter","created":{"date-parts":[[2010,7,24]],"date-time":"2010-07-24T11:52:18Z","timestamp":1279972338000},"page":"31-46","source":"Crossref","is-referenced-by-count":0,"title":["Selected Operations and Applications of n-Tape Weighted Finite-State Machines"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Kempe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"A\u00eft-Mokhtar, S., Chanod, J.-P.: Incremental finite-state parsing. In: Proc. 5th Int. Conf. ANLP, Washington, DC, USA, pp. 72\u201379 (1997)","DOI":"10.3115\/974557.974569"},{"key":"4_CR2","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Palo Alto (2003)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1007541817488","volume":"34","author":"M. Brent","year":"1999","unstructured":"Brent, M.: An efficient, probabilistically sound algorithm for segmentation and word discovery. Machine Learning\u00a034, 71\u2013106 (1999)","journal-title":"Machine Learning"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1142\/S0129054108005760","volume":"19","author":"J.-M. Champarnaud","year":"2008","unstructured":"Champarnaud, J.-M., Guingne, F., Kempe, A., Nicart, F.: Algorithms for the join and auto-intersection of multi-tape weighted finite-state machines. Int. Journal of Foundations of Computer Science\u00a019(2), 453\u2013476 (2008)","journal-title":"Int. Journal of Foundations of Computer Science"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Creutz, M., Lagus, K.: Unsupervised models for morpheme segmentation and morfology learning. ACM Transactions on Speech and Language Processing\u00a04(1) (2007)","DOI":"10.1145\/1187415.1187418"},{"key":"4_CR6","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, San Diego (1974)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development\u00a09(1), 47\u201368 (1965)","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science\u00a0108(1), 45\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1162\/089120101750300490","volume":"27","author":"J. Goldsmith","year":"2001","unstructured":"Goldsmith, J.: Unsupervised learning of the morphology of a natural language. Computational Linguistics\u00a027, 153\u2013198 (2001)","journal-title":"Computational Linguistics"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science\u00a078(2), 347\u2013355 (1991)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","unstructured":"Isabelle, P., Kempe, A.: Automatic string alignment for finite-state transducers (2004) (Unpublished work)"},{"issue":"3","key":"4_CR12","first-page":"331","volume":"20","author":"R.M. Kaplan","year":"1994","unstructured":"Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020(3), 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"4_CR13","unstructured":"Karttunen, L., Ga\u00e1l, T., Kempe, A.: Xerox finite state complier, Xerox Research Centre Europe, Grenoble, France (1998), Online demo and documentation http:\/\/www.xrce.xerox.com\/competencies\/content-analysis\/fsCompiler\/"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kay, M.: Nonconcatenative finite-state morphology. In: Proc. 3rd Int. Conf. EACL, Copenhagen, Denmark, pp. 2\u201310 (1987)","DOI":"10.3115\/976858.976860"},{"key":"4_CR15","unstructured":"Kempe, A.: Acronym-meaning extraction from corpora using multitape weighted finite-state machines. Research report 2006\/019, Xerox Research Centre Europe, Meylan, France (2006)"},{"key":"4_CR16","unstructured":"Kempe, A.: Viterbi algorithm generalized for n-tape best-path search. In: Proc. 8th Int. Workshop FSMNLP, Pretoria, South Africa (2009)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45089-0_11","volume-title":"Implementation and Application of Automata","author":"A. Kempe","year":"2003","unstructured":"Kempe, A., Baeijs, C., Ga\u00e1l, T., Guingne, F., Nicart, F.: WFSC \u2013 A new weighted finite state compiler. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 108\u2013119. Springer, Heidelberg (2003)"},{"key":"4_CR18","unstructured":"Kempe, A., Champarnaud, J.-M., Eisner, J.: A note on join and auto-intersection of n-ary rational relations. In: Watson, B., Cleophas, L. (eds.) Proc. Eindhoven FASTAR Days, Eindhoven, Netherlands, 2004. TU\/e CS TR, vol.\u00a004\u201340, pp. 64\u201378 (2004)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/11605157_16","volume-title":"Implementation and Application of Automata","author":"A. Kempe","year":"2006","unstructured":"Kempe, A., Champarnaud, J.-M., Eisner, J., Guingne, F., Nicart, F.: A class of rational n-WFSM auto-intersections. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 266\u2013274. Springer, Heidelberg (2006)"},{"key":"4_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/11780885_13","volume-title":"Finite-State Methods and Natural Language Processing","author":"A. Kempe","year":"2006","unstructured":"Kempe, A., Champarnaud, J.-M., Guingne, F., Nicart, F.: Wfsm auto-intersection and join algorithms. In: Yli-Jyr\u00e4, A., Karttunen, L., Karhum\u00e4ki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol.\u00a04002, pp. 120\u2013131. Springer, Heidelberg (2006)"},{"key":"4_CR21","unstructured":"Kempe, A., Guingne, F., Nicart, F.: Algorithms for weighted multi-tape automata. Research report 2004\/031, Xerox Research Centre Europe, Meylan, France (2004)"},{"key":"4_CR22","unstructured":"Kiraz, G.A.: Linearization of nonlinear lexical representations. In: Coleman, J. (ed.) Proc. 3rd ACL SIG Computational Phonology, Madrid, Spain (1997)"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1162\/089120100561647","volume":"26","author":"G.A. Kiraz","year":"2000","unstructured":"Kiraz, G.A.: Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic. Computational Lingistics\u00a026(1), 77\u2013105 (2000)","journal-title":"Computational Lingistics"},{"key":"4_CR24","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Heidelberg (1986)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, S., Byrne, W.: A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In: Proc. Int. Conf. HLT-NAACL, Edmonton, Canada, pp. 63\u201370 (2003)","DOI":"10.3115\/1073445.1073464"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44977-9_1","volume-title":"Implementation and Application of Automata","author":"M. Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 1\u201323. Springer, Heidelberg (2003)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0031388","volume-title":"Automata Implementation","author":"M. Mohri","year":"1998","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol.\u00a01436, pp. 144\u2013158. Springer, Heidelberg (1998)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11812128_13","volume-title":"Implementation and Application of Automata","author":"F. Nicart","year":"2006","unstructured":"Nicart, F., Champarnaud, J.-M., Cs\u00e1ki, T., Ga\u00e1l, T., Kempe, A.: Multi-tape automata with symbol classes. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 126\u2013136. Springer, Heidelberg (2006)"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"431","DOI":"10.7551\/mitpress\/3007.003.0017","volume-title":"Finite-State Language Processing","author":"F.C.N. Pereira","year":"1997","unstructured":"Pereira, F.C.N., Riley, M.D.: Speech recognition by composition of weighted finite automata. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 431\u2013453. MIT Press, Cambridge (1997)"},{"key":"4_CR30","unstructured":"Pirkola, A., Toivonen, J., Keskustalo, H., Visala, K., J\u00e4rvelin, K.: Fuzzy translation of cross-lingual spelling variants. In: Proc. 26th Annual Int. ACM SIGIR, Toronto, Canada, 2003, pp. 345\u2013352 (2003)"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E. Post","year":"1946","unstructured":"Post, E.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society\u00a052, 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"4_CR32","unstructured":"Pustejovsky, J., Casta\u00f1o, J., Cochran, B., Kotecki, M., Morrell, M., Rumshisky, A.: Linguistic knowledge extraction from medline: Automatic construction of an acronym database. In: Proc. 10th World Congress on Health and Medical Informatics, Medinfo 2001 (2001)"},{"issue":"2","key":"4_CR33","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On n-tape finite state acceptors. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 76\u201381 (1964)","DOI":"10.1109\/SWCT.1964.17"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Schwartz, A., Hearst, M.: A simple algorithm for identifying abbreviation definitions in biomedical texts. In: Proc. Pacific Symposium on Biocomputing, PSB-2003 (2003)","DOI":"10.1142\/9789812776303_0042"},{"issue":"1","key":"4_CR36","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"#cr-split#-4_CR37.1","doi-asserted-by":"crossref","unstructured":"Yeates, S., Bainbridge, D., Witten, I.H.: Using compression to identify acronyms in text. In: Proc. Data Compression Conf. (DCC-2000), Snowbird, Utah, USA (2000);","DOI":"10.1109\/DCC.2000.838229"},{"key":"#cr-split#-4_CR37.2","unstructured":"Also published in a longer form as Working Paper 00\/01, Department of Computer Science, University of Waikato (January 2000)"}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14684-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T09:30:46Z","timestamp":1740303046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14684-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146831","9783642146848"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14684-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}