Pages that link to "Item:Q2999265"
From MaRDI portal
The following pages link to A Learnable Representation for Syntax Using Residuated Lattices (Q2999265):
Displaying 10 items.
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- Language-theoretic and finite relation models for the (full) Lambek calculus (Q2398205) (← links)
- Distributional learning of conjunctive grammars and contextual binary feature grammars (Q2424694) (← links)
- Learning Conjunctive Grammars and Contextual Binary Feature Grammars (Q2799213) (← links)
- On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results (Q2835051) (← links)
- Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus (Q2964014) (← links)
- A Language Theoretic Approach to Syntactic Structure (Q3172826) (← links)
- Categorial Grammars and Their Logics (Q4611658) (← links)
- Some Syntactic Interpretations in Different Systems of Full Lambek Calculus (Q5213652) (← links)
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples (Q5964066) (← links)
