Strong Lexicalization of Tree Adjoining Grammars

Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining grammars cannot be transformed into a normal form (preserving the generated tree language), in which each production contains a lexical symbol. A more powerful model, the simple context-free tree grammar, admits such a normal form. It can be effectively constructed and the maximal rank of the non

• Type: Journal
• Year: 2012
• Where: ACL
• Authors: Andreas Maletti, Joost Engelfriet
• Keywords: ACL 2012, Computational Linguistics, Maximal Rank, Tree Adjoining Grammars, Tree Language