The power of Extended top-down tree transducers

SIAM Journal on Computing

Volumn 39, Issue 2, 2009, Pages 410-430

  Maletti, Andreas ^a,b   Graehl, Jonathan ^c   Hopkins, Mark ^d   Knight, Kevin ^c  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d UNIVERSITY OF POTSDAM   (Germany)

Author keywords

Composition closure; Hierarchy; Natural language processing; Tree transducer

Indexed keywords

COMPOSITION CLOSURE; EDINBURGH UNIVERSITY; HASSE DIAGRAMS; HIERARCHY; NATURAL LANGUAGE PROCESSING; TOP-DOWN TREE TRANSDUCERS; TREE TRANSDUCER; TREE TRANSFORMATION;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; QUERY LANGUAGES;

PIEZOELECTRIC TRANSDUCERS;

EID: 67650162516     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070699160     Document Type: Article

References (29)

1. A. ARNOLD AND M. DAUCHET, Bi-transductions de forêts, in Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, Edinburgh University Press, Edinburgh, 1976, pp. 74-86.
2. A. ARNOLD AND M. DAUCHET, Morphismes et bimorphismes d'arbres., Theoret. Comput. Sci., 20 (1982), pp. 33-93.
3. B. S. BAKER, Composition of top-down and bottom-up tree transductions, Inform. and Control, 41 (1979), pp. 186-213.
4. N. CHOMSKY, Aspects of the Theory of Syntax, MIT Press, Cambridge, MA, 1965.
5. B. COURCELLE AND P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes I, Theoret. Comput. Sci., 17 (1982), pp. 163-191.
6. B. COURCELLE AND P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes II, Theoret. Comput. Sci., 17 (1982), pp. 235-257.
7. M. DAUCHET, Transductions inversibles de forêts, Thèse 3ème cycle, Université de Lille, 1975.
8. M. DAUCHET, Transductions de forêts. Bimorphismes de magmoïdes, Thèse d'État, Université de Lille, 1977.
9. M. DAUCHET AND S. TISON, Structural complexity of classes of tree languages, in Tree Automata and Languages, North-Holland, Amsterdam, 1992, pp. 327-354.
10. J. ENGELFRIET, Bottom-up and top-down tree transformations-a comparison, Math. Systems Theory, 9 (1975), pp. 198-231.
11. J. ENGELFRIET, Top-down tree transducers with regular look-ahead, Math. Systems Theory, 10 (1976), pp. 289-303.
12. J. ENGELFRIET, Three hierarc hies of transducers, Math. Systems Theory, 15 (1982), pp. 95-125.
13. J. ENGELFRIET, E. LILIN, AND A. MALETTI, Extended multi bottom-up tree transducers, in Proceedings of the 12th International Conference Developments in Language Theory, Lecture Notes in Comput. Sci. 5257, Springer-Verlag, Berlin, 2008, pp. 289-300.
14. J. ENGELFRIET AND H. VOGLER, Macro tree transducers, J. Comput. System Sci., 31 (1985), pp. 71-146.
15. J. ENGELFRIET AND H. VOGLER, Modular tree transducers, Theoret. Comput. Sci., 78 (1991), pp. 267-303.
16. Z. FÜLÖP, On attributed tree transducers, Acta Cybernet., 5 (1981), pp. 261-279.
17. F. GÉCSEG AND M. STEINBY, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
18. F. GÉCSEG AND M. STEINBY, Tree languages, in Handbook of Formal Languages, Vol. 3, G. Rozenberg and A. Salomaa, eds., Springer-Verlag, Berlin, 1997, Chap. 1, pp. 1-68.
19. J. GRAEHL AND K. KNIGHT, Training tree transducers, in Proceedings of the 2004 Human Language Technology Conference NAACL, 2004, pp. 105-112.
20. J. E. HOPCROFT AND J. D. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
21. D. JURAFSKY AND J. H. MARTIN, Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Processing, Prentice-Hall, Upper Saddle River, NJ, 2000.
22. K. KNIGHT AND J. GRAEHL, An overview of probabilistic tree transducers for natural language processing, in Proceedings of the 6th International Conference on Intelligent Text Processing and Computational Linguistics, 2005, pp. 1-24.
23. A. MALETTI, Compositions of extended top-down tree transducers, Inform. and Comput., 206 (2008), pp. 1187-1196.
24. C. MANNING AND H. SCHÜTZE, Foundations of Statistical Natural Language Processing, MIT Press, Cambridge, MA, 1999.
25. J.-C. RAOULT, Rational tree relations, Bull. Belg. Math. Soc., 4 (1997), pp. 149-176.
26. W. C. ROUNDS, Mappings and grammars on trees, Math. Systems Theory, 4 (1970), pp. 257-287.
27. S. M. SHIEBER, Synchronous grammars as tree transducers, in Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, 2004, pp. 88-95.
28. 2 sequential machine maps, J. Comput. System Sci., 4 (1970), pp. 339-367.
29. J. W. THATCHER, Tree Automata: An Informal Survey, in Currents in the Theory of Computing, Prentice-Hall, Englewood Cliffs, NJ, 1973, pp. 143-172.