There is a unique initial state p, a unique final state q, and a state for each possible document phrase.
for all 1 ≤ i ≤ i ≤ n, there is a state that corresponds to the document phrase beginning at position i and ending at position i , d i i , which we will refer to as r i,i .