Learnable classes of categorial grammars
Learnable classes of categorial grammars
Inference of Reversible Languages
Journal of the ACM (JACM)
Transition network grammars for natural language analysis
Communications of the ACM
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
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
When categorial grammars meet regular grammatical inference
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Transducer inference by assembling specific languages
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Good types are useful for learning
Logic and grammar
| Hi-index | 0.00 |
In this paper, we interpret in terms of operations applying on extended finite state automata some algorithms that have been specified on categorial grammars to learn subclasses of context-free languages. The algorithms considered implement specialization strategies. This new perspective also helps to understand how it is possible to control the combinatorial explosion that specialization techniques have to face, thanks to a typing approach.