An application of lexicalized grammars in English-Persian translation

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 596-600

  Feili, Heshaam ^a   Ghassem Sani, Gholamreza ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER AIDED LANGUAGE TRANSLATION; FORESTRY; MACHINE TRANSLATION; SEMANTICS;

DIVERGENTS; FRENCH-ENGLISH; LANGUAGE PAIRS; MACHINE TRANSLATIONS; PERSIANS; PROPERTY; SEMANTIC FEATURES; SYNCHRONOUS TREE-ADJOINING GRAMMARS; SYNTACTIC FEATURES; TREE ADJOINING GRAMMARS;

DECISION TREES;

EID: 84869153144     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Abeille and Y. Schabes, Parsing idioms in tree adjoining grammars, In Proceedings of the 4th Conference of the European Chapter of the Association for Computational Linguistics, Manchester, England, 1989.
2. A. Abeille, Y. Schabes, and A. Joshi, Using Lexicalized Tags for Machine Translation, In Proceedings of the 13th International Conference on Computational Linguistics (COLING 90), pp. 1-6, Helsinki, Finland, 1990.
3. J.W. Amtrup, H. Mansouri Rad, K. Megerdoomian, and R. Zajac, Persian-English Machine Translation: An Overview of the Shiraz Project, Memoranda in computer and cognitive science, 2000.
4. M. Bateni, Tosif-e Sakhtari Zaban-e Farsi [Describing the Persian Structure], Tehran, Iran, Amir-Kabir Press, 1995.
5. E. de la Clergerie, M.A. Alonso Pardo, and D. Cabrero Souto, A Tabular Interpretation of Bottom-up Automata for TAG, In Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+4), pp. 42-45, Philadelphia, PA, USA, 1998.
6. E. de la Clergerie and M.A. Alonso Pardo, A Tabular Interpretation of a Class of 2-Stack Automata, In Proceedings of the 17th International Conference on Computational Linguistics (COLING 98) and the 36th Annual Meeting of the Association for Computational Linguistics (ACL 98), pp. 1333-1339, Montreal, Canada, 1998.
7. B.J. Dorr, Machine translation divergences: A formal description and proposed solution, Computational Linguistics, 20(4): 597-633, 1994.
8. M. Dras and C. Han, Korean-English MT and S-TAG, In Proceedings of the 6th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+6), pp. 206-219, Venice, Italy, 2002.
9. P. Khanlari, Tarikh-e Zaban-e Farsi [History of Persian Language], Tehran, Iran, Simorgh Press, 1995.
10. D. Mark and T. Bleam, How problematic are clitics for S-TAG Translation?, In Proceedings of 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pp. 241- 244, Paris, France, 2000.
11. K. Megerdoomian, Unification-Based Persian Morphology, In Proceedings of CICLing 2000, Alexander Gelbukh, Center of Investigation on Computation-IPN, Mexico, 2000.
12. K. Megerdoomian, Persian Computational Morphology: A unification-based approach, NMSU, CLR, Memoranda in Computer and Cognitive Science Report, 2000.
13. T. Mitchell, Machine Learning, McGraw Hill, 1997.
14. S.M. Shieber and Y. Schabes, Synchronous tree adjoining grammars, In Proceedings of the 13th International Conference on Computational Linguistics (COLING 90), pp. 253-258, Helsinki, Finland, 1990.
15. M. Stevenson, Word Sense Disambiguation: The case for combining Knowledge Sources, CSLI publication, Stanford, CA, 2003.
16. G. Van Noord, Head-corner parsing for TAG, Computational Intelligence, 10(4), pp. 525 - 534, 1994.
17. XTAG Research Group, A Lexicalized Tree Adjoining Grammar for English, Technical Report IRCS 98-18, Institute for Research in Cognitive Science, University of Pennsylvania, pp. 5-10, 1998.