ALEPH: an EBMT system based on the preservation of proportional analogies between sentences across languages

2005 International Workshop on Spoken Language Translation, IWSLT 2005

Volumn , Issue , 2005, Pages 37-44

  Lepage, Yves ^a   Denoual, Etienne ^a  

^a ADVANCED TELECOMMUNICATIONS RESEARCH INSTITUTE INTERNATIONAL   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TRANSLATION (LANGUAGES);

ANALOGICAL EQUATION; DATA TRACKS; EXAMPLE-BASED MACHINE TRANSLATION; LANGUAGE PAIRS; MACHINE TRANSLATION SYSTEMS; STATE OF THE ART; THIRD PLACES;

C (PROGRAMMING LANGUAGE);

EID: 85133342120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. N. HABASH, “Generation-heavy hybrid machine translation,” in Proceedings of the International Natural Language Generation Conference (INLG’02), New York, 2002, pp. 185–191.
2. Y. LEPAGE and G. PERALTA, “Using paradigm tables to generate new utterances similar to those existing in linguistic resources,” in Proceedings of LREC-2004, vol. 1, Lisbonne, May 2004, pp. 243–246.
3. F. de SAUSSURE, Cours de linguistique générale. Lausanne et Paris: Payot, 1995.
4. H. PAUL, Prinzipien der Sprachgeschichte. Tübingen: Niemayer, 1920.
5. L. BLOOMFIELD, Language. New York: Holt, 1933.
6. E. ITKONEN and J. HAUKIOJA, Grammaticalization: Abduction, Analogy, and Rational Explanation, 1999, pp. 159–175.
7. D. HOFSTADTER and the Fluid Analogies Research Group, Fluid Concepts and Creative Analogies. New York: Basic Books, 1994.
8. Y. LEPAGE, “Solving analogies on words: an algorithm,” in Proceedings of COLING-ACL’98, vol. I, Montreal, Aug. 1998, pp. 728–735. [Online]. Available: http://acl.ldc.upenn.edu/P/P98/P98-1120.pdf
9. G. A. STEPHEN, String searching algorithms. Singapore New Jersey London Hong Kong: World scientific, 1994.
10. L. ALLISON and T. I. DIX, “A bit string longest common subsequence algorithm,” Information Processing Letter, vol. 23, pp. 305–310, 1986.
11. E. UKKONEN, “Algorithms for approximate string matching,” Information and Control, vol. 64, pp. 100–118, 1985.
12. R. A. WAGNER and M. J. FISCHER, “The string-to-string correction problem,” Journal for the Association of Computing Machinery, vol. 21, no. 1, pp. 168–173, Jan. 1974.
13. Y. LEPAGE, “Analogy and formal languages,” in Proceedings of FG/MOL 2001, Helsinki, Aug. 2001, pp. 1–12.
14. L. ILIE, On Ambiguity in Internal Contextual Languages. in [18], 1998, pp. 29–45.
15. S. M. SHIEBER, “Evidence against the context-freeness of natural language,” Linguistics and Philosophy, vol. 8, pp. 333–343, 1985.
16. A. JOSHI, K. VIJAY-SHANKER, and D. WEIR, The Convergence of Mildly Context-Sensitive Grammar Formalisms, 1991, pp. 31–81.
17. Y. AKIBA, M. FEDERICO, N. KANDO, H. NAKAIWA, M. PAUL, and J. TSUJII, “Overview of the IWSLT04 evaluation campaign,” in Proc. of the International Workshop on Spoken Language Translation, Kyoto, Japan, 2004, pp. 1–12.
18. C. MARTÍN-VIDE, Mathematical and computational analysis of natural language. Amsterdam / Philadelphia: John Benjamins Publishing Co., 1998.