Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ACL
2012

favoriteEmaildiscussreport

178views Computational Linguistics» more ACL 2012»

Strong Lexicalization of Tree Adjoining Grammars

11 years 7 months ago

Strong Lexicalization of Tree Adjoining Grammars

Download aclweb.org

Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that ﬁnitely 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

Andreas Maletti, Joost Engelfriet

Real-time Traffic

ACL 2012 | Computational Linguistics | Maximal Rank | Tree Adjoining Grammars | Tree Language |

claim paper

Related Content

» Extraction of Tree Adjoining Grammars from a Treebank for Korean

» Generating the XTAG English Grammar Using Metarules

» Statistical Parsing with an AutomaticallyExtracted Tree Adjoining Grammar

» Automatically Extracting and Comparing Lexicalized Grammars for Different Languages

» Generating an LTAG out of a Principlebased Hierarchical Representation

» Generating Parallel Multilingual LFGTAG Grammars from a MetaGrammar

» Anchoring a Lexicalized TreeAdjoining Grammar for Discourse

» Lexical and Syntactic Rules in a Tree Adjoining Grammar

» Structure Sharing in Lexicalized TreeAdjoining Grammars

Post Info
More Details (n/a)

Added	29 Sep 2012
Updated	29 Sep 2012
Type	Journal
Year	2012
Where	ACL
Authors	Andreas Maletti, Joost Engelfriet

Comments (0)