Efficient parsing with Linear Context-Free Rewriting Systems

Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing

Recently, a supertagging-based approach for parsing discontinuous constituent trees with linear context-free rewriting systems (LCFRS) was introduced. We reformulate their algorithm for the extraction of supertags from t…

Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems

Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication

We describe a matrix multiplication recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time $O(n^{\omega d})$ where $M(m) = O(m^{\omega})$ is the running time for $m \…

Lexicalization of Probabilistic Linear Context-free Rewriting Systems

In the field of constituent parsing, probabilistic grammar formalisms have been studied to model the syntactic structure of natural language. More recently, approaches utilizing neural models gained lots of traction in t…

Advances in Using Grammars with Latent Annotations for Discontinuous Parsing

We present new experiments that transfer techniques from Probabilistic Context-free Grammars with Latent Annotations (PCFG-LA) to two grammar formalisms for discontinuous parsing: linear context-free rewriting systems an…