NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
CHARACTERIZING STRUCTURAL DESCRIPTIONS PRODUCED BY VARIOUS GRAMMATICAL FORMALISMS
K. Vijay-Shanker
|
David J. Weir
|
Aravind K. Joshi
|
Paper Details:
Month: July
Year: 1987
Location: Stanford, California, USA
Venue:
ACL |
Citations
URL
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
Laura Kallmeyer
|
Wolfgang Maier
|
Hybrid Grammars for Discontinuous Parsing
Mark-Jan Nederhof
|
Heiko Vogler
|
Feasible Learnability of Formal Grammars and The Theory of Natural Language Acquisition
Naoki ABE
|
Bottom-Up Earley Deduction
Gregor Erbach
|
Computation of Infix Probabilities for Probabilistic Context-Free Grammars
Mark-Jan Nederhof
|
Giorgio Satta
|
Adaptor Grammars for Learning Non-Concatenative Morphology
Jan A. Botha
|
Phil Blunsom
|
Parsing Mildly Non-Projective Dependency Structures
Carlos Gómez-Rodríguez
|
David Weir
|
John Carroll
|
Dependency Trees and the Strong Generative Capacity of CCG
Alexander Koller
|
Marco Kuhlmann
|
Treebank Grammar Techniques for Non-Projective Dependency Parsing
Marco Kuhlmann
|
Giorgio Satta
|
Efficient parsing with Linear Context-Free Rewriting Systems
Andreas van Cranenburgh
|
NEW FRONTIERS BEYOND CONTEXT-FREENESS: DI-GRAMMARS AND DI-AUTOMATA.
Peter Staudacher
|
A Tractable Extension of Linear Indexed Grammars
Bill Keller
|
David Weir
|
Chinese Numbers, MIX, Scrambling, and Concatenation Grammars Range
Pierre Boullier
|
Tabular Algorithms for TAG Parsing
Miguel A. Alonso
|
David Cabrero
|
Eric de la Clergerie
|
Manuel Vilares
|
Grammar Factorization by Tree Decomposition
Daniel Gildea
|
Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
Carlos Gómez-Rodríguez
|
John Carroll
|
David Weir
|
On the String Translations Produced by Multi Bottom–Up Tree Transducers
Daniel Gildea
|
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
Laura Kallmeyer
|
Wolfgang Maier
|
Mildly Non-Projective Dependency Grammar
Marco Kuhlmann
|
Chinese Number-Names, Tree Adjoining Languages, and Mild Context-Sensitivity
Daniel Radzinski
|
Minimal-length linearizations for mildly context-sensitive dependency trees
Y. Albert Park
|
Roger Levy
|
Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems
Carlos Gómez-Rodríguez
|
Marco Kuhlmann
|
Giorgio Satta
|
David Weir
|
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
Carlos Gómez-Rodríguez
|
Marco Kuhlmann
|
Giorgio Satta
|
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Daniel Gildea
|
Constraints on Strong Generative Power
David Chiang
|
On the Applicability of Global Index Grammars
José M. Castaño
|
Mildly Context-Sensitive Dependency Languages
Marco Kuhlmann
|
Mathias Möhl
|
An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two
Carlos Gómez-Rodríguez
|
Giorgio Satta
|
A Polynomial-Time Parsing Algorithm for TT-MCTAG
Laura Kallmeyer
|
Giorgio Satta
|
An Earley Parsing Algorithm for Range Concatenation Grammars
Laura Kallmeyer
|
Wolfgang Maier
|
Yannick Parmentier
|
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
Benoît Sagot
|
Giorgio Satta
|
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
|
MIX Is Not a Tree-Adjoining Language
Makoto Kanazawa
|
Sylvain Salvati
|
Polynomial Learnability and Locality of Formal Grammars
Naoki Abe
|
COMBINATORY CATEGORIAL GRAMMARS: GENERATIVE POWER AND RELATIONSHIP TO LINEAR CONTEXT-FREE REWRITING SYSTEMS
David J. Weir
|
Aravind K. Joshi
|
TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG
Aravind K. Joshi
|
K. Vijay-Shanker
|
Head Corner Parsing for Discontinuous Constituency
Gertjan van Noord
|
RECOGNITION OF LINEAR CONTEXT-FREE REWRITING SYSTEMS
Giorgio Satta
|
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
David J. Weir
|
PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS, FINITE-STATE TRANSLATION SYSTEMS, AND POLYNOMIAL-TIME RECOGNIZABLE SUBCLASSES OF LEXICAL-FUNCTIONAL GRAMMARS
Hiroyuki Seki
|
Ryuichi Nakanishi
|
Yuichi Kaji
|
Sachiko Ando
|
Tadao Kasami
|
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
Owen Rambow
|
Parsing Linear Context-Free Rewriting Systems
Håkan Burden
|
Peter Ljunglöf
|
Stochastic Multiple Context-Free Grammar for RNA Pseudoknot Modeling
Yuki Kato
|
Hiroyuki Seki
|
Tadao Kasami
|
Pomset mcfgs
Michael Pan
|
Direct Parsing of Discontinuous Constituents in German
Wolfgang Maier
|
Distributions on Minimalist Grammar Derivations
Tim Hunter
|
Chris Dyer
|
On the Parameterized Complexity of Linear Context-Free Rewriting Systems
Martin Berglund
|
Henrik Björklund
|
Frank Drewes
|
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
|