Robert...EDS - questons/comments
- Posted by Tony Bucholtz <tony_bucholtz at HOTMAIL.COM> Feb 12, 2001
- 399 views
G'day all >...Kat wrote... >If one assumes every word in the sentence is a typo, then every word >must >be compared to find a tree of possible correct words for the >entire >sentence. Anything else is throwing away info. There's a thing called a "suffix tree" that apparently is very useful for text searching and other things. I've only just started reading up on them, so I'm no expert, but the basic idea is to build a tree of strings (and substrings) and then search the tree for matching words and part-words... I think that's right... Anyway, fire up your search engine and see if suffix trees are any use to you. Regards Tony