NTS languages are deterministic and congruential
Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
String-rewriting systems
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
On the learnability and usage of acyclic probabilistic finite automata
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Introduction to Formal Language Theory
Introduction to Formal Language Theory
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
Unsupervised induction of stochastic context-free grammars using distributional clustering
ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7
Distributional phrase structure induction
ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7
Identifying hierarchical structure in sequences: a linear-time algorithm
Journal of Artificial Intelligence Research
Evolutionary induction of stochastic context free grammars
Pattern Recognition
LARS: A learning algorithm for rewriting systems
Machine Learning
Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Upper bounds for unsupervised parsing with unambiguous non-terminally separated grammars
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
Data-driven computational linguistics at FaMAF-UNC, Argentina
YIWCALA '10 Proceedings of the NAACL HLT 2010 Young Investigators Workshop on Computational Approaches to Languages of the Americas
Bounding the maximal parsing performance of non-terminally separated grammars
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
A local search algorithm for grammatical inference
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
PAC-learning unambiguous NTS languages
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Large scale inference of deterministic transductions: tenjinno problem 1
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 0.00 |
This paper describes the winning entry to the Omphalos context free grammar learning competition. We describe a context-free grammatical inference algorithm operating on positive data only, which integrates an information theoretic constituent likelihood measure together with more traditional heuristics based on substitutability and frequency. The competition is discussed from the perspective of a competitor. We discuss a class of deterministic grammars, the Non-terminally Separated (NTS) grammars, that have a property relied on by our algorithm, and consider the possibilities of extending the algorithm to larger classes of languages.