A Datalog recognizer for almost affine -CFGs

DOI10.1007/978-3-642-23211-4_2zbMATH Open1348.68276OpenAlexW1165981MaRDI QIDQ3172825FDOQ3172825

Authors: Pierre Bourreau, S. Salvati 

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_2

Recommendations

• Building PMCFG Parsers as Datalog Program Transformations
• scientific article; zbMATH DE number 4106818
• scientific article; zbMATH DE number 1406022
• Abstract categorial parsing as linear logic programming
• Categorial grammar and type theory

zbMATH Keywords

parsingDatalogabstract categorial grammarscontext-free \(\lambda \)-grammarsdeleting grammarstyping properties

Mathematics Subject Classification ID

Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Natural language processing (68T50)

Cites Work

• An extension of basic functionality theory for \(\lambda\)-calculus
• On the membership problem for non-linear abstract categorial grammars
• Uniqueness of normal proofs in implicational intuitionistic logic
• Game semantics and uniqueness of type inhabitance in the simply-typed \(\lambda \)-calculus

Cited In (2)

• The IO and OI hierarchies revisited
• DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF

Uses Software

• Datalog

This page was built for publication: A Datalog recognizer for almost affine \(\lambda \)-CFGs

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