A Dynamic Bayesian framework to model context and memory in edit distance learning: An application to pronunciation classification

ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2005, Pages 338-345

  Filali, Karim ^a   Bilmes, Jeff ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN FRAMEWORKS; CLASSIFICATION TASKS; COMPUTATIONAL BIOLOGY; DYNAMIC BAYESIAN NETWORKS; EDIT DISTANCE; ERROR RATE; GRAPHICAL MODEL; METHOD OF LEARNING; MODEL SPACES; NATURAL LANGUAGE PROCESSING;

BAYESIAN NETWORKS; BIOINFORMATICS; COMPUTATIONAL LINGUISTICS; LEARNING ALGORITHMS; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH RECOGNITION;

DISTANCE EDUCATION;

EID: 84859884577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. 1987. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8(2):277-284.
2. L. R. Bahl and F. Jelinek. 1975. Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition. Trans. on Information Theory, 21:404-411.
3. J. Bilmes and C. Bartels. 2003. On triangulating dynamic graphical models. In Uncertainty in Artificial Intelligence: Proceedings of the 19th Conference, pages 47-56. Morgan Kaufmann.
4. J. Bilmes and G. Zweig. 2002. The Graphical Models Toolkit: An open source software system for speech and time-series processing. Proc. IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing.
5. J. J. Godfrey, E. C. Holliman, and J. McDaniel. 1992. SWITCHBOARD: Telephone speech corpus for research and development. In ICASSP, volume 1, pages 517-520.
6. S. Greenberg, J. Hollenback, and D. Ellis. 1996. Insights into spoken language gleaned from phonetic transcription of the switchboard corpus. In ICSLP, pages S24-27.
7. P. N. Klein. 1998. Computing the edit-distance between unrooted ordered trees. In Proceedings of 6th Annual European Symposium, number 1461, pages 91-102. (Pubitemid 128117046)
8. S.L. Lauritzen. 1996. Graphical Models. Oxford Science Publications.
9. G. Leusch, N. Ueffing, and H. Ney. 2003. A novel string-to-string distance measure with applications to machine translation evaluation. In Machine Translation Summit IX, pages 240-247.
10. V. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 10:707-710.
11. R. Lowrance and R. A. Wagner. 1975. An extension to the string-to-string correction problem. J. ACM, 22(2):177-183.
12. M. Mohri. 2002. Edit-distance of weighted automata. In CIAA, volume 2608 of Lecture Notes in Computer Science, pages 1-23. Springer.
13. K. Murphy. 2002. Dynamic Bayesian Networks: Representation, Inference and Learning. Ph.D. thesis, U.C. Berkeley, Dept. of EECS, CS Division.
14. R. Myers, R.C. Wison, and E.R. Hancock. 2000. Bayesian graph edit distance. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22:628-635.
15. M. Neuhaus and H. Bunke. 2004. A probabilistic approach to learning costs for graph edit distance. In ICPR, volume 3, pages 389-393.
16. P. A. Rentzepopoulos and G. K. Kokkinakis. 1996. Efficient multilingual phoneme-to-grapheme conversion based on hmm. Comput. Linguist., 22(3):351-376. (Pubitemid 126420354)
17. E. S. Ristad and P. N. Yianilos. 1998. Learning string edit distance. Trans. on Pattern Recognition and Machine Intelligence, 20(5):522-532.
18. D. Shapira and J. A. Storer. 2003. Large edit distance with multiple block operations. In SPIRE, volume 2857 of Lecture Notes in Computer Science, pages 369-377. Springer. (Pubitemid 137634361)
19. E. Ukkonen. 1985. Algorithms for approximate string matching. Inf. Control, 64(1-3):100-118.
20. R. A. Wagner and M. J. Fischer. 1974. The string-tostring correction problem. J. ACM, 21(1):168-173.
21. J. Wei. 2004. Markov edit distance. Trans. on Pattern Analysis and Machine Intelligence, 26(3):311-321.