TY - GEN
T1 - Unsupervised learning of probabilistic context-free grammar using iterative biclustering
AU - Tu, Kewei
AU - Honavar, Vasant
PY - 2008
Y1 - 2008
N2 - This paper presents PCFG-BCL, an unsupervised algorithm that learns a probabilistic context-free grammar (PCFG) from positive samples. The algorithm acquires rules of an unknown PCFG through iterative biclustering of bigrams in the training corpus. Our analysis shows that this procedure uses a greedy approach to adding rules such that each set of rules that is added to the grammar results in the largest increase in the posterior of the grammar given the training corpus. Results of our experiments on several benchmark datasets show that PCFG-BCL is competitive with existing methods for unsupervised CFG learning.
AB - This paper presents PCFG-BCL, an unsupervised algorithm that learns a probabilistic context-free grammar (PCFG) from positive samples. The algorithm acquires rules of an unknown PCFG through iterative biclustering of bigrams in the training corpus. Our analysis shows that this procedure uses a greedy approach to adding rules such that each set of rules that is added to the grammar results in the largest increase in the posterior of the grammar given the training corpus. Results of our experiments on several benchmark datasets show that PCFG-BCL is competitive with existing methods for unsupervised CFG learning.
UR - http://www.scopus.com/inward/record.url?scp=56649091092&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56649091092&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-88009-7_18
DO - 10.1007/978-3-540-88009-7_18
M3 - Conference contribution
AN - SCOPUS:56649091092
SN - 3540880089
SN - 9783540880080
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 224
EP - 237
BT - Grammatical Inference
T2 - 9th International Colloquium on Grammatical Inference, ICGI 2008
Y2 - 22 September 2008 through 24 September 2008
ER -