title: Horizontal Markovization
body: <p>I have to implement horizontal markovization (NLP concept) and I'm having a little trouble understanding what the trees will look like. I've been reading the <a href="http://nlp.stanford.edu/~manning/papers/unlexicalized-parsing.pdf">Klein and Manning paper</a>, but they don't explain what the trees with horizontal markovization of order 2 or order 3 will look like. Could someone shed some light on the algorithm and what the trees are SUPPOSED to look like? I'm relatively new to NLP.</p>