NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
Tree-Adjoining Grammar Parsing and Boolean Matrix Multiplication
Giorgio Satta
|
Paper Details:
Year: 1994
Venue:
CL |
Citations
URL
The Computational Complexity of the Correct-Prefix Property for TAGs
Mark-Jan Nederhof
|
On the Applicability of Global Index Grammars
José M. Castaño
|
TAL Recognition in O(M(n2)) Time
Sanguthevar Rajasekaran
|
Shibu Yooseph
|
Fast Context-Free Parsing Requires Fast Boolean Matrix Multiplication
Lillian Lee
|
Restrictions on Tree Adjoining Languages
Giorgio Satta
|
William Schuler
|
No URLs Found
Field Of Study
Language
English
Similar Papers
Anaphora and Discourse Structure
Bonnie Webber
|
Matthew Stone
|
Aravind Joshi
|
Alistair Knott
|
The OTIM Formal Annotation Model: A Preliminary Step before Annotation Scheme
Philippe Blache
|
Roxane Bertrand
|
Mathilde Guardiola
|
Marie-Laure Guénot
|
Christine Meunier
|
Irina Nesterenko
|
Berthille Pallaud
|
Laurent Prévot
|
Béatrice Priego-Valverde
|
Stéphane Rauzy
|
Coordination and context-dependence in the generation of embodied conversation
Justine Cassell
|
Matthew Stone
|
Hao Yan
|
THE INTONATIONAL STRUCTURING OF DISCOURSE
Julia Hirschberg
|
Janet Pierrehumbert
|
Gesture Theory is Linguistics: On Modelling Multimodality as Prosody
Dafydd Gibbon
|