The following pages link to (Q4223176):
Displayed 21 items.
- A model of language learning with semantics and meaning-preserving corrections (Q343904) (← links)
- Languages as hyperplanes: grammatical inference with string kernels (Q413838) (← links)
- Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages (Q442141) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Grammar induction by unification of type-logical lexicons (Q1959226) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Learning tree languages from positive examples and membership queries (Q2381576) (← links)
- Language structure: psychological and social constraints (Q2460193) (← links)
- Identification of birfsa languages. (Q2490821) (← links)
- On learnability of restricted classes of categorial grammars (Q2642526) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Categorial Dependency Grammars with Iterated Sequences (Q2963992) (← links)
- Good Types Are Useful for Learning (Q3013026) (← links)
- Learning tree languages from text (Q3512593) (← links)
- Learning discrete categorial grammars from structures (Q3514641) (← links)
- The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable (Q4923557) (← links)
- Learnability of type-logical grammars (Q4923558) (← links)
- k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures (Q4924528) (← links)
- Learning Lambek Grammars from Proof Frames (Q5414961) (← links)