A Learnable Representation for Syntax Using Residuated Lattices
From MaRDI portal
Publication:2999265
DOI10.1007/978-3-642-20169-1_12zbMath1325.91046OpenAlexW1515407551MaRDI QIDQ2999265
Publication date: 11 May 2011
Published in: Formal Grammar (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20169-1_12
Computational learning theory (68Q32) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Linguistics (91F20) Ordered semigroups and monoids (06F05)
Related Items
A Language Theoretic Approach to Syntactic Structure ⋮ Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus ⋮ Categorial Grammars and Their Logics ⋮ Learning Conjunctive Grammars and Contextual Binary Feature Grammars ⋮ Probabilistic learnability of context-free grammars with basic distributional properties from positive examples ⋮ Some Syntactic Interpretations in Different Systems of Full Lambek Calculus ⋮ On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results
This page was built for publication: A Learnable Representation for Syntax Using Residuated Lattices
