tailieunhanh - Báo cáo khoa học: "LEXICAL AND SYNTACTIC RULES IN A TREE ADJOINING GRAMMAR"

Taking examples from English and French idioms, this paper shows that not only constituent structures rules but also most syntactic rules (such as topicalization, wh-question, pronominalization .) are subject to lexical constraints (on top of syntactic, and possibly semantic, ones). We show that such puzzling phenomena are naturally handled in a 'lexJcalized' formalism such as Tree Adjoining Grammar. The extended domain of locality of TAGs also allows one to 'lexicalize' syntactic rules while defining them at the level of constituent structures. . | LEXICAL AND SYNTACTIC RULES IN A TREE ADJOINING GRAMMAR Anne Abeillé LADL and UFRL University of Paris 7-Jussieu abeille@ ABSTRACT Taking examples from English and French idioms this paper shows that not only constituent structures rules but also most syntactic rules such as lopicalization wfa-questiCHt pronominalization . are subject to lexical constraints on top of syntactic and possibly semantic ones . We show that such puzzling phenomena are naturally handled in a iexicalized formalism such as Tree Adjoining Grammar. The extended domain of locality of TAGS also allows one to lexicalize syntactic rules while defining them at the level of constituent structures. 1 INTRODUCTION TO LEXICALIZED GRAMMARS Lexicalizing Phrase Structure rules In most current linguistic theories the information put in the lexicon has been increased in both amount and complexity. Viewing constituent structures as projected from the lexicon for example avoids the often noted redundancy between Phrase Structure rules and subcategorization frames. Lexica constraints on the well-formedness of linguistic outputs has also simplified the previous transformational machinery. Collapsing phrase-structure rules into the lexicon is the overt purpose of lexicalized grammars as defined by Schabes Abeillé Joshi 1988 a lexicalized grammar consists of a finite set of elementary structures each of which is systematically associated with one or more lexical item serving as head . These structures are combined with one another with one or more combining operation s . These structures specify extended domains of locality as compared to CFGs over which lexical constraints can be stated. The grammar consists of a lexicon where each lexical item is associated with a finite number of structures for which that item is the head . We here assume familiarity with Tree Adjoining Grammars which are naturally lexicalized The author wants to thank Yves Schabes Aravind Joshi Maurice Gross Sharon Cote and .