Principles and implementation of deductive parsing

DOI10.1016/0743-1066(95)00035-IMaRDI QIDQ3125891zbMATHFDO

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

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)

Abstract: We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.

Cited in

(20)

• Logical approximation for program analysis
• Tabular parsing and algebraic transformations
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Weighted parsing for grammar-based language models over multioperator monoids
• Parsing with derivatives
• Weighted Deductive Parsing and Knuth's Algorithm
• Hierarchical phrase-based translation
• Error-repair parsing schemata
• Parsing schemata and correctness of parsing algorithms
• Tabulation for multi-purpose partial parsing
• Enhancing practical TAG parsing efficiency by capturing redundancy
• Parsing MELL proof nets
• The dual of concatenation
• Preference Logic Grammars: Fixed point semantics and application to data standardization
• scientific article; zbMATH DE number 1926650 (Why is no real title available?)
• Dynamic Programming Algorithms as Products of Weighted Logic Programs
• Symmetric categorial grammar
• Structural similarity within and among languages
• Minimalist Grammar Transition-Based Parsing
• A semantic framework for proof evidence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125891)