{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:49Z","timestamp":1725492409830},"publisher-location":"Berlin, Heidelberg","reference-count":35,"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_1","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"1-23","source":"Crossref","is-referenced-by-count":10,"title":["Edit-Distance of Weighted Automata"],"prefix":"10.1007","author":[{"given":"Mehryar","family":"Mohri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"unstructured":"Cyril Allauzen and Mehryar Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, to appear, 2002.","key":"1_CR1"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1051\/ita:2000111","volume":"34","author":"M.-P. B\u00e9al","year":"2000","unstructured":"Marie-Pierre B\u00e9al and Olivier Carton. Asynchronous sliding block maps. Informatique Th\u00e9orique et Applications, 34(2):139\u2013156, 2000.","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"1_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979."},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988."},{"key":"1_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1992","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press: Cambridge, MA, 1992."},{"unstructured":"Corinna Cortes, P atrick Haffner, and Mehryar Mohri. Rational Kernels. In Advances in Neural Information Processing Systems (NIPS 2002), volume to appear, Vancouver, Canada, December 2002.","key":"1_CR6"},{"unstructured":"Maxime Crochemore and Wojciech Rytter. Text Algorithms. Oxford University Press, 1994.","key":"1_CR7"},{"doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1, 1959.","key":"1_CR8","DOI":"10.1007\/BF01386390"},{"key":"1_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"R. Durbin","year":"1998","unstructured":"R. Durbin, S.R. Eddy, A. Krogh, and G.J. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge UK, 1998."},{"unstructured":"Samuel Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974.","key":"1_CR10"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Christiane Frougny and Jacques Sakarovitch. Synchronized Rational Relations of Finite and Infinite Words. Theoretical Computer Science, 108(1):45\u201382, 1993.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Vaibhava Goel and William Byrne. Task Dependent Loss Functions in Speech Recognition: A* Search over Recognition Lattices. In Proceedings of Eurospeech\u201999, Budapest, Hungary, 1999.","key":"1_CR12","DOI":"10.21437\/Eurospeech.1999-291"},{"key":"1_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Dan Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, UK., 1997."},{"unstructured":"David Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California at Santa Cruz, 1999.","key":"1_CR14"},{"unstructured":"Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa. Construction of the CDAWG for a Trie. In Proceedings of the Prague Stringology Conference (PSC\u201901). Czech Technical University, 2001.","key":"1_CR15"},{"key":"1_CR16","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"Werner Kuich and Arto Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986."},{"unstructured":"Eugene L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976.","key":"1_CR17"},{"key":"1_CR18","first-page":"707","volume":"10","author":"V. I. Levenshtein","year":"1966","unstructured":"Vladimir I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady, 10:707\u2013710, 1966.","journal-title":"Soviet Physics-Doklady"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1006\/csla.2000.0152","volume":"14","author":"L. Mangu","year":"1997","unstructured":"Lidia Mangu, Eric Brill, and Andreas Stolcke. Finding consensus in speech recognition: word error minimization and other applications of confusion networks. Computer Speech and Language, 14(4):373\u2013400, 1997.","journal-title":"Computer Speech and Language"},{"unstructured":"Mehryar Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23:2, 1997.","key":"1_CR20"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1142\/S0129054102000996","volume":"13","author":"M. Mohri","year":"2002","unstructured":"Mehryar Mohri. Generic Epsilon-Removal and Input Epsilon-Normalization Algorithms for Weighted Transducers. International Journal of Foundations of Computer Science, 13(1):129\u2013143, 2002.","journal-title":"International Journal of Foundations of Computer Science"},{"unstructured":"Mehryar Mohri. Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics, to appear, 2002.","key":"1_CR22"},{"unstructured":"Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. Weighted Automata in Text and Speech Processing. In Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECAI-96), Workshop on Extended finite state models of language, Budapest, Hungary. ECAI, 1996.","key":"1_CR23"},{"doi-asserted-by":"crossref","unstructured":"Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17\u201332, January 2000.","key":"1_CR24","DOI":"10.1016\/S0304-3975(99)00014-6"},{"doi-asserted-by":"crossref","unstructured":"Mehryar Mohri and Richard Sproat. An Efficient Compiler for Weighted Rewrite Rules. In 34th Meeting of the Association for Computational Linguistics (ACL\u2019 96), Proceedings of the Conference, Santa Cruz, California. ACL, 1996.","key":"1_CR25","DOI":"10.3115\/981863.981894"},{"unstructured":"Mohri, Mehryar and Fernando C. N. Pereira and Michael Riley. General-Purpose Finite-State Machine Software Tools. http:\/\/www.research.att.com\/sw\/tools\/fsm , AT&T Labs-Research, 1997.","key":"1_CR26"},{"key":"1_CR27","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":"Fernando C. N. Pereira and Michael D. Riley. Speech recognition by composition of weighted finite automata. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 431\u2013453. MIT Press, Cambridge, Massachusetts, 1997."},{"issue":"5","key":"1_CR28","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.682181","volume":"20","author":"E. S. Ristad","year":"1998","unstructured":"Eric S. Ristad and Peter N. Yianilos. Learning string edit distance. IEEE Trans. PAMI, 20(5):522\u2013532, 1998.","journal-title":"IEEE Trans. PAMI"},{"key":"1_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Arto Salomaa and Matti Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag: New York, 1978."},{"doi-asserted-by":"crossref","unstructured":"Marcel Paul Sch\u00fctzenberger. On the definition of a family of automata. Information and Control, 4, 1961.","key":"1_CR30","DOI":"10.1016\/S0019-9958(61)80020-X"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","volume":"4","author":"M. Sch\u00fctzenberger Paul","year":"1977","unstructured":"Marcel Paul Sch\u00fctzenberger. Sur une variante des fonctions s\u00e9quentielles. Theoretical Computer Science, 4(1):47\u201357, 1977.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Andreas Stolcke, Yochai Konig, and Mitchel Weintraub. Explicit Word Error Minimization in N-best List Rescoring. In Proceedings of Eurospeech\u201997, Rhodes, Greece, 1997.","key":"1_CR32","DOI":"10.21437\/Eurospeech.1997-68"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"Esko Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100\u2013118, 1985.","journal-title":"Information and Control"},{"issue":"1","key":"1_CR34","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wagner","year":"1974","unstructured":"Robert A. Wagner and Michael J. Fisher. The string to string correction problem. Journal of the Association for Computing Machinery (ACM), 21(1):168\u2013173, 1974.","journal-title":"Journal of the Association for Computing Machinery (ACM)"},{"unstructured":"Chris Watkins. Dynamic alignment kernels. Technical Report CSD-TR-98-11, Royal Holloway, University of London, 1999.","key":"1_CR35"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T14:08:21Z","timestamp":1708265301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}