Efficient parsing with Linear Context-Free Rewriting Systems

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Conference of the European Chapter of the Association for Computational Linguistics

• Publication date

  2012-04-23

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• PLCFRS Parsing of English Discontinuous Constituents

  2011influential reference
• Discontinuous Data-Oriented Parsing: A mildly context-sensitive all-fragments grammar

  2011influential reference
• Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems

  2011influential reference
• Data-driven Parsing using PLCFRS Data-driven Parsing using Probabilistic Linear Context-Free Rewriting Systems

  2011influential reference
• Unavoidable Ill-nestedness in Natural Language and the Adequacy of Tree Local-MCTAG Induced Dependency Structures

  2010cited by this paper
• Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems

  2010cited by this paper
• Optimal Parsing Strategies for Linear Context-Free Rewriting Systems

  2010influential reference
• Direct Parsing of Discontinuous Constituents in German

  2010influential reference
• Parsing Beyond Context-Free Grammars

  2010cited by this paper
• Characterizing Discontinuity in Constituent Treebanks

  2009cited by this paper
• Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems

  2009cited by this paper
• Treebank Grammar Techniques for Non-Projective Dependency Parsing

  2009cited by this paper
• Parsing Discontinuous Phrase Structure with Grammatical Functions

  2008cited by this paper
• TuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar Engineering

  2008cited by this paper
• Treebanks and Mild Context-Sensitivity

  2008cited by this paper
• Discontinuity Revisited: An Improved Conversion to Context-Free Representations

  2007cited by this paper
• Multilevel Coarse-to-Fine PCFG Parsing

  2006cited by this paper
• Probabilistic models of word order and syntactic discontinuity

  2005cited by this paper
• Proceedings of Formal Grammar 2003

  2003cited by this paper
• Accurate Unlexicalized Parsing

  2003cited by this paper
• Head-Driven Statistical Models for Natural Language Parsing

  2003cited by this paper
• Probabilistic Parsing for German Using Sister-Head Dependencies

  2003cited by this paper
• Parsing german with sister-head dependencies

  2003cited by this paper
• Thesis

  2002cited by this paper
• The TIGER Treebank

  2001cited by this paper
• Guided Parsing of Range Concatenation Languages

  2001cited by this paper
• Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar

  2000cited by this paper
• An Annotation Scheme for Free Word Order Languages

  1997cited by this paper
• Proposal for a Natural Language Processing Syntactic Backbone

  1997cited by this paper
• The equivalence of four extensions of context-free grammars

  1994influential reference
• Building a Large Annotated Corpus of English: The Penn Treebank

  1993cited by this paper
• Characterizing mildly context-sensitive grammar formalisms

  1988cited by this paper
• Characterizing Structural Descriptions Produced by Various Grammatical Formalisms

  1987cited by this paper
• Evidence against the context-freeness of natural language

  1985cited by this paper
• Parentheticals and discontinuous constituent structure

  1982cited by this paper

• Supertagging-based Parsing with Linear Context-free Rewriting Systems

  2020cites this paper
• Two characterisation results of multiple context-free grammars and their application to parsing

  2020cites this paper
• Latent Variable Grammars for Discontinuous Parsing

  2019cites this paper
• Approximation of weighted automata with storage

  2017cites this paper
• Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

  2017cites this paper
• Chomsky-Schützenberger parsing for weighted multiple context-free languages

  2017cites this paper
• Neural Discontinuous Constituency Parsing

  2017influential citation
• Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures

  2017cites this paper
• Coarse-To-Fine Parsing for Expressive Grammar Formalisms

  2017cites this paper
• LR Parsing for LCFRS

  2016cites this paper
• Discontinuity (Re)²-visited: A Minimalist Approach to Pseudoprojective Constituent Parsing

  2016cites this paper
• Discontinuous parsing with continuous trees

  2016cites this paper
• Data-Oriented Parsing with Discontinuous Constituents and Function Tags

  2016influential citation
• Discontinuous Incremental Shift-reduce Parsing

  2015cites this paper
• UvA-DARE ( Digital Academic Repository ) Extraction of Phrase-Structure Fragments with a Linear Average Time Tree-Kernel

  2015cites this paper
• Parsing as Reduction

  2015cites this paper
• Improvements to the performance and applicability of dependency parsing

  2015cites this paper
• Discosuite - A parser test suite for German discontinuous structures

  2014cites this paper
• Incorporating Semi-supervised Features into Discontinuous Easy-First Constituent Parsing

  2014cites this paper
• Hybrid Grammars for Discontinuous Parsing

  2014cites this paper
• Experiments with Easy-first nonprojective constituent parsing

  2014cites this paper
• Data-Driven Parsing with Discontinuous Structures

  2013cites this paper
• LCFRS binarization and debinarization for directional parsing

  2013cites this paper
• Discontinuous Parsing with an Efficient and Accurate DOP Model

  2013influential citation
• Synchronous Linear Context-Free Rewriting Systems for Machine Translation

  2013cites this paper
• Rich statistical parsing and literary language

  2012cites this paper
• PLCFRS Parsing Revisited: Restricting the Fan-Out to Two

  2012cites this paper