NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
Carlos Gómez-Rodríguez
|
Marco Kuhlmann
|
Giorgio Satta
|
Paper Details:
Month: June
Year: 2010
Location: Los Angeles, California
Venue:
NAACL |
Citations
URL
Generalized Higher-Order Dependency Parsing with Cube Pruning
Hao Zhang
|
Ryan McDonald
|
Efficient parsing with Linear Context-Free Rewriting Systems
Andreas van Cranenburgh
|
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
Laura Kallmeyer
|
Wolfgang Maier
|
Mildly Non-Projective Dependency Grammar
Marco Kuhlmann
|
On the Complexity of CCG Parsing
Marco Kuhlmann
|
Giorgio Satta
|
Peter Jonsson
|
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
Pierluigi Crescenzi
|
Daniel Gildea
|
Andrea Marino
|
Gianluca Rossi
|
Giorgio Satta
|
Strong Lexicalization of Tree Adjoining Grammars
Andreas Maletti
|
Joost Engelfriet
|
Parsing as Reduction
Daniel Fernández-González
|
André F. T. Martins
|
Synchronous Linear Context-Free Rewriting Systems for Machine Translation
Miriam Kaeshammer
|
On the Parameterized Complexity of Linear Context-Free Rewriting Systems
Martin Berglund
|
Henrik Björklund
|
Frank Drewes
|
No URLs Found
Field Of Study
Linguistic Trends
Syntax
Language
English
Similar Papers
DATR: A Language for Lexical Knowledge Representation
Roger Evans
|
Gerald Gazdar
|
Generating and Interpreting Referring Expressions as Belief State Planning and Plan Recognition
Dustin Smith
|
Henry Lieberman
|
RECSA: Resource for Evaluating Cross-lingual Semantic Annotation
Achim Rettinger
|
Lei Zhang
|
Daša Berović
|
Danijela Merkler
|
Matea Srebačić
|
Marko Tadić
|
Exploiting Lexical Regularities in Designing Natural Language Systems
Boris Katz
|
Beth Levin
|
Book Reviews: Speaking: From Intention to Articulation
M. Martin Taylor
|
Insup Taylor
|