Optimal unification and learning algorithms for categorial grammars
Fundamenta Informaticae
On Limit Points for Some Variants of Rigid Lambek Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Fast Learning from Strings of 2-Letter Rigid Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
A Tool for Language Learning Based on Categorial Grammars and Semantic Information
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Some Classes of Regular Languages Identifiable in the Limit from Positive Data
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
On Mixing Deduction and Substitution in Lambek Categorial Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
An Abductive Mechanism for Natural Language Processing Based on Lambek Calculus
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Semantic bootstrapping of type-logical grammar
Journal of Logic, Language and Information
Rigid grammars in the associative-commutative Lambek calculus are not learnable
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Rigid Lambek grammars are not learnable from strings
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
k-valued non-associative Lambek categorial grammars are not learnable from strings
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Unsupervised learning of morphology without morphemes
MPL '02 Proceedings of the ACL-02 workshop on Morphological and phonological learning - Volume 6
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Theoretical Computer Science - Logic, language, information and computation
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Logical investigations on the adequacy of certain feature-based theories of natural language
NAACL-DocConsortium '06 Proceedings of the 2006 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume: doctoral consortium
Optimal Unification of Infinite Sets of Types
Fundamenta Informaticae
Rough Sets and Learning by Unification
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
From Unification Compactness to Learnability
Fundamenta Informaticae
How to Split Recursive Automata
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Item-based constructions and the logical problem
PMHLA '05 Proceedings of the Workshop on Psychocomputational Models of Human Language Acquisition
Grammatical inference and computational linguistics
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
A bibliographical study of grammatical inference
Pattern Recognition
Grammar Induction by Unification of Type-logical Lexicons
Journal of Logic, Language and Information
Good types are useful for learning
Logic and grammar
Tarski's principle, categorial grammars and learnability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On dispersed and choice iteration in incrementally learnable dependency types
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Using tree transducers for grammatical inference
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On categorial grammars as logical information systems
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
k-valued non-associative lambek grammars (without product) form a strict hierarchy of languages
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Learnable classes of general combinatory grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
Theoretical Computer Science
Rough Sets and Learning by Unification
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
From Unification Compactness to Learnability
Fundamenta Informaticae
Optimal Unification of Infinite Sets of Types
Fundamenta Informaticae
Optimal Unification and Learning Algorithms for Categorial Grammars
Fundamenta Informaticae
Hi-index | 0.00 |