Publication:4223176
From MaRDI portal
zbMath0937.68130MaRDI QIDQ4223176
Publication date: 17 December 1998
learning; learning algorithm; unification; grammar; identification in the limit; categorial grammar; learnability theory
68T05: Learning and adaptive systems in artificial intelligence
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68T50: Natural language processing
Related Items
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, A model of language learning with semantics and meaning-preserving corrections, Languages as hyperplanes: grammatical inference with string kernels, Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages, Set systems: order types, continuous nondeterministic deformations, and quasi-orders, On families of categorial grammars of bounded value, their learnability and related complexity questions, Algebraic structures in categorial grammar, 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., On learnability of restricted classes of categorial grammars, Learning Tree Languages, Categorial Dependency Grammars with Iterated Sequences, Good Types Are Useful for Learning, Learning tree languages from text, Learning discrete categorial grammars from structures
