Parsing Beyond Context-Free Grammars

DOI10.1007/978-3-642-14846-0zbMath1252.68005OpenAlexW162009636MaRDI QIDQ2785998

Laura Kallmeyer

Publication date: 16 September 2010

Published in: Cognitive Technologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14846-0

zbMATH Keywords

tree adjoining grammarcontext-free grammarparsingrange concatenation grammarmultiple context-free grammar

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Natural language processing (68T50) Linguistics (91F20)

Related Items (18)

Algebraic dynamic programming for multiple context-free grammars ⋮ Insertion Minimalist Grammars: Eliminating Redundancies between Merge and Move ⋮ Characterising REGEX languages by regular languages equipped with factor-referencing ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ Two applications of monoid actions to cross-sections ⋮ A language hierarchy of binary relations ⋮ Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey ⋮ LR parsing for LCFRS ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Unnamed Item ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ Improved descriptional complexity results on generalized forbidding grammars ⋮ Syntactic stochastic processes: definitions, models, and related inference problems ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy ⋮ Groups whose word problems are not semilinear ⋮ IDL-PMCFG, a grammar formalism for describing free word order languages

This page was built for publication: Parsing Beyond Context-Free Grammars