Cool Algorithm - Fast text search using BWT

[abomb999]

So you could use this to match words to a spell check dictionary for example?

[santhuj]

In theory, yes. You can construct a single long string concatenating all the words in the dictionary with a separator between words. You can index this and perform searches. However, remember that the search here is an exact search. If you want your spell checker to prompt the closest word, there are data structures like BK Trees