Sciweavers

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

99

Voted

LATA
2009
Springer

85views Artificial Intelligence» more LATA 2009»

Two Equivalent Regularizations for Tree Adjoining Grammars

15 years 9 months ago

Two Equivalent Regularizations for Tree Adjoining Grammars

Download www.uni-trier.de

Anna Kasprzik

Real-time Traffic

Automata Theory | LATA 2009 |

claim paper

Related Content

» Feature Unification in TAG Derivation Trees

» Comparing the performance of two TAGbased surface realisers using controlled grammar trave...

» Synchronous Tree Adjoining Machine Translation

» A Tree Transducer Model for Synchronous TreeAdjoining Grammars

» The Use of Shared Forests in Tree Adjoining Grammar Parsing

» RTG based surface realisation for TAG

» Developmental Evaluation in Genetic Programming A Position Paper

» Licensing and Tree Adjoining Grammar in Government Binding Parsing

» Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structu...

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	LATA
Authors	Anna Kasprzik

Comments (0)