Principles and implementation of deductive parsing

DOI10.1016/0743-1066(95)00035-IzbMATH Open0866.68062arXivcmp-lg/9404008MaRDI QIDQ3125891FDOQ3125891

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)

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.

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

Recommendations

• scientific article; zbMATH DE number 1063800
• scientific article; zbMATH DE number 1926650
• scientific article
• scientific article; zbMATH DE number 972132

zbMATH Keywords

parsingcategorial grammarstree-adjoining grammarslexicalized context-free grammars

Mathematics Subject Classification ID

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

Cited In (20)

• Structural similarity within and among languages
• Symmetric categorial grammar
• Preference Logic Grammars: Fixed point semantics and application to data standardization
• Parsing MELL proof nets
• Tabular parsing and algebraic transformations
• Parsing schemata and correctness of parsing algorithms
• Weighted Deductive Parsing and Knuth's Algorithm
• Error-repair parsing schemata
• Tabulation for multi-purpose partial parsing
• Dynamic Programming Algorithms as Products of Weighted Logic Programs
• Hierarchical Phrase-Based Translation
• The dual of concatenation
• Logical approximation for program analysis
• Weighted parsing for grammar-based language models over multioperator monoids
• Parsing with derivatives
• Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy
• Minimalist Grammar Transition-Based Parsing
• Title not available (Why is that?)
• A semantic framework for proof evidence
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS

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)