Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because of its extended domain of locality and its factoring recursion out from the domain of local dependencies (Joshi, 1985, Kroch and Joshi, 1985, Abeille, 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" (Shieber and Schabes [1990]). Transfer rules are stated as correspondences between nodes of trees of large domain of locality which are associated with words. We can thus define lexical transfer rules that avoid the defects of a mere word-to-word approach but still benefit from the simplicity and elegance of a lexical approach.We rely on the French and English LTAG grammars (Abeille [1988], Abeille [1990 (b)], Abeille et al. [1990], Abeille and Schabes [1989, 1990]) that have been designed over the past two years jointly at University of Pennsylvania and University of Paris 7-Jussieu.
[1]
Anne Abeillé,et al.
Parsing French with Tree Adjoining Grammar: some linguistic accounts
,
1988,
COLING.
[2]
Klaus Netter,et al.
Translation by Structural Correspondences
,
1989,
EACL.
[3]
L. Danlos,et al.
La traduction automatique
,
1989
.
[4]
Aravind K. Joshi,et al.
Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars
,
1988,
COLING.
[5]
Anthony S. Kroch,et al.
The Linguistic Relevance of Tree Adjoining Grammar
,
1985
.
[6]
Anne Abeillé,et al.
A Lexicalized Tree Adjoining Grammar for English
,
1990
.
[7]
Mike Rosner,et al.
The , T Framework in Eurotra: A Theoretically Committed Notation for MT
,
1986,
COLING.
[8]
Aravind K. Joshi,et al.
Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions?
,
1985
.
[9]
Anne Abeillé,et al.
Parsing Idioms in Lexicalized TAGs
,
1989,
EACL.
[10]
Bonnie J. Dorr.
Conceptual Basis of the Lexicon in Machine Translation
,
1989
.
[11]
Aravind K. Joshi,et al.
An Introduction to Tree Adjoining Grammar
,
1987
.
[12]
Stuart M. Shieber,et al.
Synchronous Tree-Adjoining Grammars
,
1990,
COLING.
[13]
Pete Whitelock,et al.
Machine translation using isomorphic UCGs
,
1988,
COLING.
[14]
Anne Abeillé,et al.
Lexical and Syntactic Rules in a Tree Adjoining Grammar
,
1990,
ACL.