NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
The Problem of Computing the Most Probable Tree in Data-Oriented Parsing and Stochastic Tree Grammars
Rens Bod
|
Paper Details:
Month: March
Year: 1995
Location: Dublin, Ireland
Venue:
EACL |
Citations
URL
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
Khalil Sima’an
|
Incremental Tree Substitution Grammar for Parsing and Sentence Prediction
Federico Sangati
|
Frank Keller
|
Solving the Problem of Cascading Errors: Approximate Bayesian Inference for Linguistic Annotation Pipelines
Jenny Rose Finkel
|
Christopher D. Manning
|
Andrew Y. Ng
|
Efficient Algorithms for Parsing the DOP Model
Joshua Goodman
|
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
|