Sciweavers

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

9

COLING
1999

favoriteEmaildiscussreport

111views Computational Linguistics» more COLING 1999»

Tree Adjoining Grammars in a Fragment of the Lambek Calculus

13 years 4 months ago

Tree Adjoining Grammars in a Fragment of the Lambek Calculus

Download acl.ldc.upenn.edu

V. Michele Abrusci, Christophe Fouqueré, Ja

Real-time Traffic

COLING 1999 | Computational Linguistics |

claim paper

Related Content

» Lambek Calculus Proofs and Tree Automata

» Parsing as Natural Deduction

» Coreference Handling in XMG

» Graph Algorithms for Improving TypeLogical Proof Search

» Compiling and Using FiniteState Syntactic Rules

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COLING
Authors	V. Michele Abrusci, Christophe Fouqueré, Jacqueline Vauzeilles

Comments (0)