179 search results - page 6 / 36 » Lambek Grammars Are Context Free |
81
Voted
IPL
2008
14 years 11 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
105
click to vote
ACL
1994
15 years 1 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
ICDAR
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a document understanding system in which the arrangement of lines of text and block separators within a document are modeled by stochastic context free grammars. A gram...
ACL
2008
2008
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
15 years 1 months ago
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
LOGCOM
2008
14 years 11 months ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...