Sciweavers

Share
COLING
1990

Using Lexicalized Tags for Machine Translation

9 years 1 months ago
Using Lexicalized Tags for Machine Translation
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out from the domain of local dependencies (Joshi, 1985, Kroch and Joshi, 1985, Abeilld, 1988). LTAG's extended domain of locality enables one to localize syntactic dependencies (such as filler-gap), as well as semantic dependencies (such as predicate-arguments). The aim of this paper is to show that these properties combined with the lexicalized property of LTAG are especially attractive for machine translation. The transfer between two languages, such as French and English, can be done by putting directly into correspondence large elementary units without going through some interlingual representation and without major changes to the source and target grammars. The underlying formalism for the transfer is "synchronous Tree Adjoining Grammars"
Anne Abeillé, Yves Schabes, Aravind K. Josh
Added 07 Nov 2010
Updated 07 Nov 2010
Type Conference
Year 1990
Where COLING
Authors Anne Abeillé, Yves Schabes, Aravind K. Joshi
Comments (0)
books