Edit-distance of weighted automata: General definitions and algorithms

International Journal of Foundations of Computer Science

Volumn 14, Issue 6, 2003, Pages 957-982

  Mohri, Mehryar ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4544382124     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103002114     Document Type: Conference Paper

References (44)

1. C. Allauzen and M. Mohri. Efficient Algorithms for Testing the Twins Property. Journal of Automata, Languages and Combinatorics, 8(2), 2003.
2. M.-P. Beal and O. Carton. Asynchronous sliding block maps. Informatique Theorique et Applications, 34(2):139-156, 2000.
3. J. Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979.
4. J. Berstel and C. Reutenauer. Rational Series and Their Languages. Springer-Verlag: Berlin-New York, 1988.
5. B. E. Boser, I. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the Fifth Annual Workshop of Computational Learning Theory, volume 5, pages 144-152, Pittsburg, 1992. ACM.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press: Cambridge, MA, 1992.
7. C. Cortes, P. Haffner, and M. Mohri. Rational Kernels. In Advances in Neural Information Processing Systems (NIPS 2002), volume 15, Vancouver, Canada, March 2003. MIT Press.
8. C. Cortes and V. Vapnik. Support-Vector Networks. Machine Learning, 20(3):273-297, 1995.
9. M. Crochemore, G. M. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proceedings of SODA 2002, pages 679-688, 2002.
10. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
11. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1, 1959.
12. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge UK, 1998.
13. S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974.
14. C. Prougny and J. Sakarovitch. Synchronized Rational Relations of Finite and Infinite Words. Theoretical Computer Science, 108(1) :45-82, 1993.
15. Z. Galil and K. Park. An Improved Algorithm for Approximate String Matching. SI AM Journal of Computing, 19(6):989-999, 1990.
16. V. Goel and W. Byrne. Task Dependent Loss Functions in Speech Recognition: A Search over Recognition Lattices. In Proceedings of Eurospeech'99, Budapest, Hungary, 1999.
17. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge, UK., 1997.
18. M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Massachusetts, 1978.
19. D. Haussler. Convolution kernels on discrete structures. Technical Report UCSCCRL-99-10, University of California at Santa Cruz, 1999.
20. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Construction of the CDAWG for a Trie. In Proceedings of the Prague Stringology Conference (PSC'01). Czech Technical University, 2001.
21. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1986.
22. G. M. Landau, E. W. Myers, and J. P. Schmidt. Incremental String Comparison. SIAM Journal of Computing, 27(2):557-582, 1998.
23. G. M. Landau and U. Vishkin. Fast Parallel and Serial Approximate String Matching. Journal of Algorithms, 10(2):157-169, 1989.
24. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976.
25. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady, 10:707-710, 1966.
26. L. Mangu, E. Brill, and A. Stolcke. Finding consensus in speech recognition: word error minimization and other applications of confusion networks. Computer Speech and Language, 14(4):373-400, 1997.
27. M. Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23:2, 1997.
28. M. Mohri. Generic Epsilon-Removal and Input Epsilon-Normalization Algorithms for Weighted Transducers. International Journal of Foundations of Computer Science, 13(1):129-143, 2002.
29. M. Mohri. Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics, 7(3):321-350, 2002.
30. M. Mohri, F. C. N. Pereira, and M. 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.
31. M. Mohri, F. C. N. Pereira, and M. Riley. General-Purpose Finite-State Machine Software Tools, http://www.research.att.com/sw/tools/fsm, AT&T Labs-Research, 1997.
32. M. Mohri, F. C. N. Pereira, and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17-32, January 2000.
33. M. Mohri and R. Sproat. An Efficient Compiler for Weighted Rewrite Rules. In 34th Meeting of the Association for Computational Linguistics (ACL '96), Proceedings of the Conference, Santa Cruz, California. ACL, 1996.
34. E. W. Myers. An O(ND) Difference Algorithm and Its Variations. Algorithmica, l(2):251-266, 1986.
35. F. C. N. Pereira and M. D. Riley. Speech recognition by composition of weighted finite automata. In E. Roche and Y. Schabes, editors, Finite-State Language Processing, pages 431-453. MIT Press, Cambridge, Massachusetts, 1997.
36. E. S. Ristad and P. N. Yianilos. Learning string edit distance. IEEE Trans. PAMI, 20(5):522-532, 1998.
37. A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag: New York, 1978.
38. M. P. Schutzenberger. On the definition of a family of automata. Information and Control, 4, 1961.
39. M. P. Schutzenberger. Sur une variante des fonctions sequentielles. Theoretical Computer Science, 4(1):47~57, 1977.
40. A. Stolcke, Y. Konig, and M. Weintraub. Explicit Word Error Minimization in N-best List Rescoring. In Proceedings of Eurospeech'97, Rhodes, Greece, 1997.
41. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100-118, 1985.
42. V. N. Vapnik. Statistical Learning Theory. John Wiley &Sons, New-York, 1998.
43. R. A. Wagner and M. J. Fisher. The string to string correction problem. Journal of the Association for Computing Machinery (ACM), 21(1):168-173, 1974.
44. C. Watkins. Dynamic alignment kernels. Technical Report CSD-TR-98-11, Royal Holloway, University of London, 1999.