Pac-learning unambiguous nts languages (2006)
| Venue: | In Proceedings of the 8th international colloquium on grammatical inference |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Clark06pac-learningunambiguous,
author = {Alexander Clark},
title = {Pac-learning unambiguous nts languages},
booktitle = {In Proceedings of the 8th international colloquium on grammatical inference},
year = {2006},
pages = {59--71},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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. 1
