The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences
NTS languages are deterministic and congruential
Journal of Computer and System Sciences
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the learnability and usage of acyclic probabilistic finite automata
Journal of Computer and System Sciences - Special issue on the eighth annual workshop on computational learning theory, July 5–8, 1995
Balls and bins: a study in negative dependence
Random Structures & Algorithms
PAC-learnability of Probabilistic Deterministic Finite State Automata
The Journal of Machine Learning Research
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Partially distribution-free learning of regular languages from positive samples
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
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
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
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
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
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
PAC-learning unambiguous k, l-NTS≤languages
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
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
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Theoretical Computer Science
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
A language theoretic approach to syntactic structure
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Three learnable models for the description of language
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.00 |
Non-terminally separated (NTS) languages are a subclass of deterministic context free languages where there is a stable relationship between the substrings of the language and the non-terminals of the grammar. We show that when the distribution of samples is generated by a PCFG, based on the same grammar as the target language, the class of unambiguous NTS languages is PAC-learnable from positive data alone, with polynomial bounds on data and computation.