Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm

DOI10.1007/978-3-662-44121-3_8zbMath1426.68134OpenAlexW1036843407MaRDI QIDQ2921948

Hans Leiß

Publication date: 14 October 2014

Published in: Formal Grammar (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.433.5341

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Related Items (6)

Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus ⋮ Learning context-free grammars from positive data and membership queries ⋮ The Strong, Weak, and Very Weak Finite Context and Kernel Properties ⋮ Learning Conjunctive Grammars and Contextual Binary Feature Grammars

This page was built for publication: Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm