A learnable representation for syntax using residuated lattices
From MaRDI portal
Publication:2999265
Recommendations
- Learning context free grammars with the syntactic concept lattice
- Logical grammars, logical theories
- The syntactic concept lattice: another algebraic theory of the context-free languages?
- Three Learnable Models for the Description of Language
- Completeness of full Lambek calculus for syntactic concept lattices
Cited in
(13)- On some extensions of syntactic concept lattices: completeness and finiteness results
- Learning context free grammars with the syntactic concept lattice
- Categorial grammars and their logics
- Language-theoretic and finite relation models for the (full) Lambek calculus
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
- Polynomial inference of universal automata from membership and equivalence queries
- The syntactic concept lattice: another algebraic theory of the context-free languages?
- Automatic concepts and automata-theoretic semantics for the full Lambek calculus
- Logical grammars, logical theories
- A language theoretic approach to syntactic structure
- Learning conjunctive grammars and contextual binary feature grammars
- Some syntactic interpretations in different systems of full Lambek calculus
- Distributional learning of conjunctive grammars and contextual binary feature grammars
This page was built for publication: A learnable representation for syntax using residuated lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999265)
