Building PMCFG Parsers as Datalog Program Transformations

DOI10.1007/978-3-662-43742-1_1MaRDI QIDQ4981264zbMATH OpenOpenAlexFDO

Authors Arthur Ball, Pierre Bourreau, Émeric Kien, S. Salvati

Publication date 24 June 2014

Published in Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43742-1_1

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 2090114
• On the decomposition of datalog program mappings
• Transformation of logic programs to FP programs based on dataflows
• scientific article; zbMATH DE number 4064537
• Monadic Datalog Tree Transducers
• Predicate transformers and higher-order programs
• Transforming constraint logic programs
• Transformations of logic programs
• Transformations of logic programs

Cited in

(1)

• A Datalog recognizer for almost affine -CFGs

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Building PMCFG Parsers as Datalog Program Transformations

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