Pages that link to "Item:Q2639050"
From MaRDI portal
The following pages link to Categorial grammars determined from linguistic data by unification (Q2639050):
Displaying 15 items.
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Semantic bootstrapping of type-logical grammar (Q1778102) (← 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)
- Learnability of pregroup grammars (Q2467214) (← links)
- On learnability of restricted classes of categorial grammars (Q2642526) (← links)
- Good Types Are Useful for Learning (Q3013026) (← links)
- CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank (Q3225465) (← links)
- Learning discrete categorial grammars from structures (Q3514641) (← links)
- Learning categorial grammar by unification with negative constraints (Q4317729) (← links)
- Head or tail? de morgan on the bounds of traditional logic (Q4391327) (← 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)
