scientific article; zbMATH DE number 1233727
From MaRDI portal
Publication:4223176
zbMath0937.68130MaRDI QIDQ4223176
Publication date: 17 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
learninglearning algorithmunificationgrammaridentification in the limitcategorial grammarlearnability theory
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Natural language processing (68T50)
Related Items (21)
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures ⋮ Learning tree languages from positive examples and membership queries ⋮ On learnability of restricted classes of categorial grammars ⋮ A model of language learning with semantics and meaning-preserving corrections ⋮ Algebraic structures in categorial grammar ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Learning tree languages from text ⋮ Learning Tree Languages ⋮ Categorial Dependency Grammars with Iterated Sequences ⋮ Learning discrete categorial grammars from structures ⋮ Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages ⋮ Grammar induction by unification of type-logical lexicons ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ Language structure: psychological and social constraints ⋮ Good Types Are Useful for Learning ⋮ Learning Lambek Grammars from Proof Frames ⋮ 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 ⋮ Identification of birfsa languages. ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions
This page was built for publication:
