terStemmer.scala">here</a></li>
            </ul></li>
        <li>TextVary stores a collection of set phrases as a Finite State Automaton(FSA). The words in those phrases are reduced to their stem forms.</li>
        <li>To detect set phrases, textVary uses a greedy algorithm, trying to find the longest phrases accepted by the FSA. A set phrase can not span across the boundaries of <em>SentencePart</em>s.</li>
    </ul>
    <p>To turn the statistics into visual feedback:</p>
    <ul>
        <li><p>The UI 