I have code for alternatives using tries
but it is memory intensive
what I understood regrading alternatives are
like this
if i/p is
abcdefgh
it will list
abcd
abcyu
abciop
abcweoiru
...
something like this
u will have half the word equal
then it just prints those that are in the dictionary
A
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
wrote:
>
> On Fri, Jul 31, 2009 at 9:42 AM, Arun N wrote:
> > I think we can use a trie and search, is the word there in trie
> > but still trie eat
Alternatives as in alternate spelling suggestions
Prakhar
On Fri, Jul 31, 2009 at 7:03 PM, Vikram Sridar wrote:
> Alternatives?? what way??
>
> In terms of implementation or providing some other functionalities??
>
>
> >
>
--~--~-~--~~~---~--~~
You received this
He meant alternate-spellings! Just like you get from MS-Word et. al.
From: Vikram Sridar
To: algogeeks@googlegroups.com
Sent: Friday, 31 July, 2009 7:03:54 PM
Subject: [algogeeks] Re: Spell Checker
Alternatives?? what way??
In terms of implementation or
Alternatives?? what way??
In terms of implementation or providing some other functionalities??
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@g
Its not onyl about searching for the word.
How would you propose alternates ?
Prakhar
On Fri, Jul 31, 2009 at 9:42 AM, Arun N 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 w
On Fri, Jul 31, 2009 at 9:42 AM, Arun N 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 wrote:
>>
>> Hi,
>>
>> How would you design a dictionary so that you can make a spell checker
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 wrote:
> Hi,
>
> How would you design a dictionary so that you can make a spell checker ?
> You would have to suggest alternates...
>
>
> Best,
> Prak
There is a very good article
(http://www.norvig.com/spell-correct.html) by Peter Norvig on the
subject.
On 7/30/09, Vikram Sridar wrote:
> Use Tries...
> They are kinda binary trees specially equipped to handle dictionary
> applications
>
> >
>
--~--~-~--~~~---~--~--
Use Tries...
They are kinda binary trees specially equipped to handle dictionary
applications
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@goo
10 matches
Mail list logo
