4 search results - page 1 / 1 » Approximating the smallest grammar: Kolmogorov complexity in... |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
ACL
1997
13 years 6 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
JMLR
2010
12 years 11 months ago
2010
We propose a class of Bayesian networks appropriate for structured prediction problems where the Bayesian network's model structure is a function of the predicted output stru...
GRAMMARS
1998
13 years 4 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...