Cubic-time Parsing and Learning Algorithms for Grammatical Bigram
This paper presents a probabilistic model of English grammar that is based upon "grammatical bigrams", i.e., syntactic relationships between pairs of words. Because of its simplicity, grammatical bigram models admit cubic-time parsing and unsupervised learning algorithms, which are described in detail.