scientific article; zbMATH DE number 3254899
From MaRDI portal
Publication:5541333
zbMath0158.25306MaRDI QIDQ5541333
No author found.
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
On learnability of restricted classes of categorial grammars ⋮ Gaifman's theorem on categorial grammars revisited ⋮ Categorial grammar - A basis for a natural language calculus? ⋮ Extending Lambek grammars to basic categorial grammars ⋮ Algebraic structures in categorial grammar ⋮ Unique typed basic categorial grammars ⋮ Hypergraph Basic Categorial Grammars ⋮ Combinatory categorial grammars as generators of weighted forests ⋮ Syntactic categories in the language of mathematics ⋮ Linguistic\(\leftrightarrow \)rational agents' semantics ⋮ On involutive nonassociative Lambek calculus ⋮ On translating context-free grammars into Lambek grammars ⋮ Commutative Lambek grammars ⋮ Learning discrete categorial grammars from structures ⋮ On the eliminability of ideal linguistic entities ⋮ A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras ⋮ Infinitary action logic: complexity, models and grammars ⋮ A polynomial algorithm for the membership problem with categorial grammars ⋮ S4 enriched multimodal categorial grammars are context-free ⋮ Type logics and pregroups ⋮ Good Types Are Useful for Learning ⋮ On translating Lambek grammars with one division into context-free grammars ⋮ Learning Lambek Grammars from Proof Frames ⋮ The multiplicative-additive Lambek calculus with subexponential and bracket modalities ⋮ A direct proof of the equivalence of free categorial grammars and simple phrase structure grammars ⋮ Some Syntactic Interpretations in Different Systems of Full Lambek Calculus ⋮ The tree-generative capacity of combinatory categorial grammars ⋮ Probabilistic grammars for natural languages ⋮ A homomorphism theorem for weighted context-free grammars ⋮ Unnamed Item ⋮ Minimization of the complexity function in the class of pushdown store automata and categorial grammars of complexity three ⋮ Linguistic matrix theory ⋮ Extensions of Lambek Calculi ⋮ Categorial dependency grammars ⋮ COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR
This page was built for publication:
