Extended multi bottom-up tree transducers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5257 LNCS, Issue , 2008, Pages 289-300

  Engelfriet, Joost ^a   Lilin, Eric ^b   Maletti, Andreas ^c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIV LILLE   (France)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS;

BOTTOM-UP; TOP-DOWN; TREE TRANSDUCERS;

TRANSDUCERS;

EID: 54249125083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85780-8_23     Document Type: Conference Paper

References (31)

1. Knight, K.: Criteria for reasonable syntax-based translation models. Personal communication (2007)
2. Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CIGLing 2005. LNGS, vol. 3406, pp. 1-24. Springer, Heidelberg (2005)
3. DeNeefe, S., Knight, K., Wang, W., Marcu, D.: What can syntax-based MT learn from phrase-based MT? In: EMNLP & CoNLL, pp. 755-763 (2007)
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (1979)
5. Graehl, J., Knight, K.: Trainingtree transducers. In: HLT-NAACL, pp. 105-112 (2004)
6. Arnold, A., Dauchet, M.: Transductions inversibles de forěts. Thèse 3ème cycle M. Dauchet, Université de Lille (1975)
7. Arnold, A., Dauchet, M.: Bi-transductions de forěts. In: ICALP, pp. 74-86. Edinburgh University Press (1976)
8. Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory 4(3), 257-287 (1970)
9. 2 sequential machine maps. J. Comput. System Sci. 4(4), 339-367 (1970)
10. Steinby, M., Tîrnǎucǎ, C.I.: Syntax-directed translations and quasi-alphabetic tree bimorphisms. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 265-276. Springer, Heidelberg (2007)
11. Aho, A. V., Ullman, J.D.: Syntax directed translations and the pushdown assembler. J. Comput. System Sci. 3(1), 37-56 (1969)
12. Shabes, Y.: Mathematical and Computational Aspects of Lexicalized Grammars. PhD thesis, University of Pennsylvania. (1990)
13. Shieber, S.M., Shabes, Y.: Synchronous tree-adjoining grammars. In: COLING, pp. 1-6 (1990)
14. Shieber, S.M.: Unifying synchronous tree adjoining grammars and tree transducers via bimorphisms. In: EACL. The Association for Computer Linguistics, pp. 377-384 (2006)
15. Arnold, A., Dauchet, M.: Morphismes et bimorphismes d'arbres. Theoret. Comput. Sci. 20, 33-93 (1982)
16. Fülöp, Z., Kühnemann, A., Vogler, H.: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91(2), 57-67 (2004)
17. Fülöp, Z., Kühnemann, A., Vogler, H.: Linear deterministic multi bottom-up tree transducers. Theoret. Comput. Sci. 347(1-2), 276-287 (2005)
18. Maletti, A.: Compositions of extended top-down tree transducers. Inform. and Comput. (to appear, 2008)
19. Engelfriet, J.: Bottom-up and top-down tree transformations: A comparison. Math. Systems Theory 9(3), 198-231 (1975)
20. Baker, B.S.: Composition of top-down and bottom-up tree transductions. Inform. and Control 41(2), 186-213 (1979)
21. Thatcher, J.W.: Tree automata: An informal survey. In: Currents in the Theory of Computing, pp. 143-172. Prentice Hall, Englewood Cliffs (1973)
22. Ganzinger, H.: Increasing modularity and language-independency in automatically generated compilers. Sci. Comput. Prog. 3(3), 223-278 (1983)
23. Giegerich, R.: Composition and evaluation of attribute coupled grammars. Acta Inform. 25(4), 355-423 (1988)
24. Kuhnemann, A.: Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technische Universität Dresden (1997)
25. Kühnemann, A.: Benefits of tree transducers for optimizing functional programs. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 146-157. Springer, Heidelberg (1998)
26. Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154(1), 34-91 (1999)
27. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10(1), 289-303 (1977)
28. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
29. Gécseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, vol. 3, pp. 1-68. Springer, Heidelberg (1997)
30. Lilin, E.: Une généralisation des transducteurs d'états finis d'arbres: les S-transducteurs. Thèse 3ème cycle, Université de Lille (1978)
31. Lilin, E.: Propriétés de clôture d'une extension de transducteurs d'arbres déter-ministes. In: Astesiano, E., Böhm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 280-289. Springer, Heidelberg (1981)