Skip Nav Destination
Article navigation
March 01 2002
Tree Adjoining Grammars: Formalisms, Linguistic Analysis and Processing
Tree Adjoining Grammars: Formalisms, Linguistic Analysis and Processing
Anne
Abeillé
and Owen
Rambow
(editors) (Université de Paris VII and AT&T Labs-Research) Stanford, CA
: CSLI Publications
(distributed by the University of Chicago Press
), 2000
, vii+478 pp; hardbound, ISBN 1-57586-251-4, $64.95; paperbound, ISBN 1-57586-252-2, $24.95
Geoffrey K. Pullum
Geoffrey K. Pullum
University of California, Santa Cruz
Search for other works by this author on:
Geoffrey K. Pullum
University of California, Santa Cruz
Online Issn: 1530-9312
Print Issn: 0891-2017
© 2002 Association for Computational Linguistics
2002
Computational Linguistics (2002) 28 (1): 77–80.
Citation
Geoffrey K. Pullum; Tree Adjoining Grammars: Formalisms, Linguistic Analysis and Processing. Computational Linguistics 2002; 28 (1): 77–80. doi: https://doi.org/10.1162/089120102317341792
Download citation file:
0
Views
0
Citations
Cited By
Related Articles
Related Book Chapters
Developing Tree-Adjoining Grammars with Lexical Descriptions
Supertagging: Using Complex Lexical Descriptions in Natural Language Processing
Developing Tree-Adjoining Grammars with Lexical Descriptions
Supertagging: Using Complex Lexical Descriptions in Natural Language Processing
From Treebanks to Tree-Adjoining Grammars
Supertagging: Using Complex Lexical Descriptions in Natural Language Processing
From Treebanks to Tree-Adjoining Grammars
Supertagging: Using Complex Lexical Descriptions in Natural Language Processing
Advertisement
