Syntax-directed translations and quasi-alphabetic tree bimorphisms

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

Volumn 4783 LNCS, Issue , 2007, Pages 265-276

  Steinby, Magnus ^a   Tîrnǎucǎ, Cǎtǎlin Ionuţ ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Natural language processing; Regular tree languages; Syntax directed translations; Tree bimorphisms

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN RECOGNITION; SYNTACTICS; TRANSLATION (LANGUAGES);

REGULAR TREE LANGUAGES; SYNTAX DIRECTED TRANSLATIONS; TREE BIMORPHISMS;

FORMAL LANGUAGES;

EID: 38149128298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76336-9_25     Document Type: Conference Paper

References (17)

1. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269-311 (1997)
2. Brown, RF., Della Pietra, S.A., Della Pietra, V.J., Mercer, R.L.: The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics 19(2), 263-312 (1993)
3. Knight, K., Al-Onaizan, Y.: Translation with finite-state devices. In: Farwell, D., Gerber, L., Hovy, E. (eds.) Proc. of the AMTA 1998, pp. 421-437. Springer, London, UK (1998)
4. Irons, E.T.: A syntax directed compiler for ALGOL 60. Communications of the ACM 4(1), 51-55 (1961)
5. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. 1: Parsing. Prentice Hall Professional Technical Reference, New Jersey (1972)
6. Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1-24. Springer, Heidelberg (2005)
7. Graehl, J., Hopkins, M., Knight, K.: Extended top-down tree transducers, submitted to HLT-NAACL 2006, New York, USA (2006)
8. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
9. Gécseg, F., Steinby, M.: Tree languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3. Beyond Words, pp. 1-68. Springer, Heidelberg (1997)
10. Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory 9(3), 198-231 (1975)
11. Baker, B.S.: Composition of top-down and bottom-up tree transductions. Information and Control 41(2), 186-213 (1979)
12. Arnold, A., Dauchet, M.: Morphismes et bimorphismes d'arbres. Theoretical Computer Science 20, 33-93 (1982)
13. Takahashi, M.: Rational relations of binary trees. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 72, pp. 524-538. Springer, Heidelberg (1977)
14. Bozapalidis, S.: Alphabetic tree relations. Theoretical Computer Science 99(2), 177-211 (1992)
15. Steinby, M.: On certain algebraically defined tree transformations. In: Demetrovics, J., Budach, L., Salomaa, A. (eds.) Algebra, Combinatorics and Logic in Computer Science, vol. I, II (Györ 1983). Colloquia Mathematica Societatis János Bolyai, North-Holland, vol. 42, pp. 745-764 (1986)
16. Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. of the TAG+ 7, Vancouver, Canada (2004)
17. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available online http://www.grappa.univ-lille3.fr/tata