21 search results - page 3 / 5 » Strongly Regular Grammars and Regular Approximation of Conte... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
TCS
2008
13 years 5 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
FINTAL
2006
13 years 9 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...