k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures (original) (raw)
Related papers
< i> k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
Electronic Notes in Theoretical Computer Science, 2003
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
Electronic Notes in Theoretical Computer Science, 2003
On intermediate structures for non-associative Lambek grammars and learnability
Proc. of the seventh Conf. Categorial Grammars ( …, 2004
k-valued non-associative Lambek categorial grammars are not learnable from strings
Proceedings of the 41st Annual Meeting on …, 2003
Rigid Grammars in the Associative-Commutative Lambek Calculus are not Learnable
2013
On rigid NL Lambek grammars inference from generalized functor-argument data
… on Formal Grammar and the 9th …, 2005
Rigid Lambek grammars are not learnable from strings
Proceedings of the 19th international conference on …, 2002
A Study on Learnability for Rigid Lambek Grammars
Corr, 2006
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
Theoretical Computer Science, 2012
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
Journal of Logic, Language and Information, 2010
Conjoinability and unification in Lambek categorial grammars
New Perspectives in Logic and Formal Linguistics, …, 2001
Learning Lambek Grammars from Proof Frames
Lecture Notes in Computer Science, 2014
Learning rigid lambek grammars and minimalist grammars from structured sentences
Third workshop on Learning Language in …, 2001
Theoretical Computer Science, 2012
Extending Lambek grammars: a logical account of minimalist grammars
Proceedings of the 39th Annual Meeting on …, 2001
Proceedings of Formal Grammar 2004
2004
Proceedings of FGVienna: The 8th conference on Formal Grammar
2003
The Logic of Categorial Grammars Lecture Notes
2012
Tree Adjoining Grammars in a fragment of the Lambek calculus
Computational Linguistics
Learnability of Pregroup Grammars
Grammatical Inference: Algorithms and …, 2004
On some similarities between D-Tree Grammars and type-logical grammars
Electronic Notes in Theoretical Computer Science, 2004
On the axiomatic systems of syntactically-categorial languages
1984
Lambek grammars, tree adjoining grammars and hyperedge replacement grammars
2008
Analyzing the Core of Categorial Grammar
2011
Towards a minimal logic for minimalist grammars: a transformational use of Lambek calculus
1999
A Concrete Categorical Model for the Lambek Syntactic Calculus
Mathematical Logic Quarterly, 1997
The logic of categorial grammars: a deductive account of natural language syntax and semantics
Finding consistent categorial grammars of bounded value: a parameterized approach
Language and Automata Theory and Applications, 2010
Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages