Principles and implementation of deductive parsing

DOI10.1016/0743-1066(95)00035-IzbMath0866.68062arXivcmp-lg/9404008MaRDI QIDQ3125891

Fernando C. N. Pereira, Stuart M. Shieber, Yves Schabes

Publication date: 6 July 1997

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cmp-lg/9404008

zbMATH Keywords

parsingcategorial grammarstree-adjoining grammarslexicalized context-free grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (15)

Symmetric categorial grammar ⋮ Logical approximation for program analysis ⋮ Weighted Deductive Parsing and Knuth's Algorithm ⋮ Hierarchical Phrase-Based Translation ⋮ Minimalist Grammar Transition-Based Parsing ⋮ A semantic framework for proof evidence ⋮ Error-repair parsing schemata ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS ⋮ Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy ⋮ Dynamic Programming Algorithms as Products of Weighted Logic Programs ⋮ The dual of concatenation ⋮ Preference Logic Grammars: Fixed point semantics and application to data standardization ⋮ Structural similarity within and among languages ⋮ Tabular parsing and algebraic transformations

This page was built for publication: Principles and implementation of deductive parsing