An overview of probabilistic tree transducers for natural language processing

Lecture Notes in Computer Science

Volumn 3406, Issue , 2005, Pages 1-24

  Knight, Kevin ^a   Graehl, Jonathan ^a  

^a University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILITY; TREES (MATHEMATICS);

FINTE-STATE STRING TRANSDUCERS (FST); PROBABILISTIC MODELING; TREE TRANSDUCERS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 24344458616     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30586-6_1     Document Type: Conference Paper

References (50)

1. Knight, K., Graehl, J.: Machine transliteration. Computational Linguistics 24 (1998)
2. Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theor. Comput. Sci. 231 (2000)
3. Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20 (1994)
4. Karttunen, L., Gaal, T., Kempe, A.: Xerox finite-state tool. Technical report, Xerox Research Centre Europe (1997)
5. van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In Boldt, O., Juergensen, H., eds.: 4th International Workshop on Implementing Automata, Springer Lecture Notes in Computer Science (2000)
6. Kanthak, S., Ney, H.: Fsa: An efficient and flexible C++ toolkit for finite state automata using on-demand computation. In: Proc. ACL. (2004)
7. Graehl, J.: Carmel finite-state toolkit, http: //www.isi.edu/licensed-sw/carmel/ (1997)
8. Knight, K., Al-Onaizan, Y.: Translation with finite-state devices. In Farwell, D., Gerber, L., Hovy, E., eds.: Proceedings of the 3rd Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup (AMTA-98), Berlin, Springer (1998) 421-437
9. Brown, P., Della Pietra, S., Della Pietra, V., Mercer, R.: The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics 19 (1993) 263-311
10. Kumar, S., Byrne, W.: A weighted finite state transducer implementation of the alignment template model for statistical machine translation. In: Proc. NAACL. (2003)
11. Och, F., Tillmann, C., Ney, H.: Improved alignment models for statistical machine translation. In: Proc. ACL. (1999)
12. Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. ACL. (2001) 523-530
13. Wu, D.: Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics 23 (1997) 377-404
14. Alshawi, H., Bangalore, S., Douglas, S.: Learning dependency translation models as collections of finite state head transducers. Computational Linguistics 26 (2000) 45-60
15. Gildea, D.: Loosely tree-based alignment for machine translation. In: Proc. ACL, Sapporo, Japan (2003)
16. Eisner, J.: Learning non-isomorphic tree mappings for machine translation. In: Proc. ACL (companion volume). (2003)
17. Melamed, I.D.: Multitext grammars and synchronous parsers. In: Proc. NAACL. (2003)
18. Knight, K., Marcu, D.: Summarization beyond sentence extraction: A probabilistic approach to sentence compression. Artificial Intelligence 139 (2002)
19. Pang, B., Knight, K., Marcu, D.: Syntax-based alignment of multiple translations extracting paraphrases and generating new sentences. In: Proc. NAACL. (2003)
20. Langkilde, I., Knight, K.: Generation that exploits corpus-based statistical knowledge. In: Proc. ACL. (1998)
21. Bangalore, S., Rambow, O.: Exploiting a probabilistic hierarchical model for generation. In: International Conference on Computational Linguistics (COLING 2000), Saarbrucken, Germany (2000)
22. Corston-Oliver, S., Gamon, M., Ringger, E.K., Moore, R.: An overview of Amalgam: A machine-learned generation module. In: Proceedings of the International Natural Language Generation Conference, New York, USA (2002) 33-40
23. Echihabi, A., Marcu, D.: A noisy-channel approach to question answering. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, Sapporo, Japan (2003)
24. Charniak, E.: Immediate-head parsing for language models. In: Proc. ACL. (2001)
25. Rounds, W.C.: Mappings and grammars on trees. Mathematical Systems Theory 4 (1970) 257-287
26. 2 sequential machine maps. J. Comput. System Sci. 4 (1970) 339-367
27. Graehl, J., Knight, K.: Training tree transducers. In: Proc. NAACL. (2004)
28. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
29. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on www.grappa.univ-lille3.fr/tata (1997) release October, 1st 2002.
30. Galley, M., Hopkins, M., Knight, K., Marcu, D.: What's in a translation rule? In: NAACL, Boston, MA (2004)
31. Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences 4 (1970) 406-451
32. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, London (1979)
33. Johnson, M.: PCFG models of linguistic tree representations. Computational Linguistics 24 (1998) 613-632
34. Collins, M.: Three generative, lexicalised models for statistical parsing. In: Proc. ACL. (1997)
35. Thatcher, J.: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci. 1 (1967) 317-322
36. Yamasaki, K., Sodeshima, Y.: Fundamental properties of pushdown tree transducers (PDTT) - a top-down case. IEICE Trans. Inf. and Syst. E76-D (1993)
37. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10 (1977) 289-303
38. Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Math. Systems Theory 9 (1975) 198-231
39. Baum, L.E., Eagon, J.A.: An inequality with application to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematical Society 73 (1967) 360-363
40. Aho, A.V., Ullman, J.D.: Translations of a context-free grammar. Information and Control 19 (1971) 439-475
41. van Noord, G.: The intersection of finite state automata and definite clause grammars. In: Proc. ACL. (1995)
42. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
43. Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 28 (1999) 652-673
44. Mohri, M., Riley, M.: An efficient algorithm for the n-best-strings problem. In: Proc. ICSLP. (2002)
45. Langkilde, I.: Forest-based statistical sentence generation. In: Proc. NAACL. (2000)
46. Nederhof, M.J., Satta, G.: Parsing non-recursive CFGs. In: Proc. ACL. (2002)
47. Knuth, D.: A generalization of Dijkstra's algorithm. Info. Proc. Letters 6 (1977)
48. Klein, D., Manning, C.: Parsing and hypergraphs. In: International Workshop on Parsing Technologies. (2001)
49. Nederhof, M.J.: Weighted deductive parsing and Knuth's algorithm. Computational Linguistics 29 (2003)
50. Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proceedings of the 13th International Conference on Computational Linguistics. Volume 3., Helsinki, Finland (1990) 253-258