Learning regular sets from queries and counterexamples
Information and Computation
On multiple context-free grammars
Theoretical Computer Science
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
A Characterization of Even Linear Languages and its Application to the Learning Problem
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
Finite-state transducers in language and speech processing
Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
A learnable representation for syntax using residuated lattices
FG'09 Proceedings of the 14th international conference on Formal grammar
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Distributional learning of abstract categorial grammars
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Integration of the dual approaches in the distributional learning of context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Logical grammars, logical theories
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
Hi-index | 0.00 |
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of features or tests that constrain various inference rules. Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and multiple context-free grammars. Finally, to illustrate the advantages of this approach, we extend it to the inference of functional transductions from positive data only, and we present a new algorithm for the inference of finite state transducers.