I'm looking for a short, simple suffix tree building/usage algorithm in Java. The best I've found so far lies withing the Semantic Discovery Toolkit, but the implementation is several thousand lines long and spans several classes. Ideally, the implementation would be as short as possible and span no more than a few hundred lines.
Does anyone have such an implementation?
There's a simple Java implementation of a suffix tree on the LiteratePrograms wiki.
It's really not hard. I've written suffix trees in a few languages. It's a very simple algorithm. If you're at the stage where you're thinking about them, you're probably able to implement one.
My one comment is, look at your data. A hashtable / binary tree might be a more efficient way to store your data. Pointers / references are as expensive as chars, if not more so!
The article "Simple Linear Work Suffix Array Construction", by Karkkainen and Sanders, terminates with 50 lines of C++. You will probably also want something to produce the LCP array. Googling for "Computing the LCP array in linear time, given S and the suffix array POS." should find you that.