scientific article; zbMATH DE number 1233727
From MaRDI portal
Publication:4223176
Recommendations
- On learnability of restricted classes of categorial grammars
- Logical Aspects of Computational Linguistics
- Tarski's principle, categorial grammars and learnability
- Learning discrete categorial grammars from structures
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- Distributional learning of abstract categorial grammars
- scientific article; zbMATH DE number 1735823
- Categorial grammars and their logics
- Categorial Grammars and Tree Languages
- Categorial Grammars and Minimalist Grammars
Cited in
(31)- Algebraic structures in categorial grammar
- Identification in the limit of categorial grammars
- Grammar induction by unification of type-logical lexicons
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
- Learning tree languages from positive examples and membership queries
- Language structure: psychological and social constraints
- Identification of birfsa languages.
- Categorial grammars determined from linguistic data by unification
- On learnability of restricted classes of categorial grammars
- scientific article; zbMATH DE number 1689576 (Why is no real title available?)
- Learning Tree Languages
- Categorial dependency grammars with iterated sequences
- Tarski's principle, categorial grammars and learnability
- Good types are useful for learning
- A model of language learning with semantics and meaning-preserving corrections
- Learning tree languages from text
- Learning discrete categorial grammars from structures
- Finding consistent categorial grammars of bounded value: a parameterized approach
- scientific article; zbMATH DE number 4045723 (Why is no real title available?)
- Languages as hyperplanes: grammatical inference with string kernels
- Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages
- scientific article; zbMATH DE number 2019598 (Why is no real title available?)
- The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable
- Learnability of type-logical grammars
- K-valued non-associative Lambek grammars are learnable from function-argument structures
- Learning Lambek grammars from proof frames
- Grammatical Inference: Algorithms and Applications
- Logical Aspects of Computational Linguistics
- Logical Aspects of Computational Linguistics
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders
- On families of categorial grammars of bounded value, their learnability and related complexity questions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223176)
