brother how to use ternary search tree .wont there be a problem of skewdness .how u balance height
On Fri, Jul 31, 2009 at 4:58 PM, Gowtham Rajappan <gowthampsgt...@gmail.com>wrote: > > On Fri, Jul 31, 2009 at 9:42 AM, Arun N<arunn3...@gmail.com> wrote: > > I think we can use a trie and search, is the word there in trie > > but still trie eats memory . > > > > Arun, > > > > On Thu, Jul 30, 2009 at 1:45 PM, Prakhar Jain <prakh...@gmail.com> > wrote: > >> > >> Hi, > >> > >> How would you design a dictionary so that you can make a spell checker ? > >> You would have to suggest alternates... > >> > >> > >> Best, > >> Prakhar > >> > >> > >> > > > > > > > > -- > > Potential is not what U have, its what U think U have!!! > > It is better to worn out than rust. > > > > > > > > > > Ternary Search Tree(TST) is a good choice for spell check, dictionary. > > > -- > Gowtham R > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
