i think edit distance algorithm can not be used here because in edit
distance problem we have a target string and a source string. Here we dont
have any target word.
I think trie can be used with some preprocessing.
On Thu, Nov 24, 2011 at 11:59 PM, atul anand atul.87fri...@gmail.comwrote:
Can you please elaborate...
On Thu, Nov 24, 2011 at 12:14 AM, atul anand atul.87fri...@gmail.comwrote:
yes levenshtein distance and BK tree can be used to solve this.
where edge weight between nodes is equal to levenshtein distance.
On Wed, Nov 23, 2011 at 7:14 PM, abhishek kumar
http://blog.notdot.net/2007/4/Damn-Cool-Algorithms-Part-1-BK-Trees
this would help.
On Thu, Nov 24, 2011 at 9:49 PM, Vijay Meena vijay...@gmail.com wrote:
Can you please elaborate...
On Thu, Nov 24, 2011 at 12:14 AM, atul anand atul.87fri...@gmail.comwrote:
yes levenshtein distance and
You are given a word and a dictionary. Now propose an algorithm edit
the word (insert / delete characters) minimally to get a word that
also exists in the dictionary. Cost of insertion and deletion is same.
Write pseudocode for it.
Seems like minimum edit distance problem but some modification is
yes levenshtein distance and BK tree can be used to solve this.
where edge weight between nodes is equal to levenshtein distance.
On Wed, Nov 23, 2011 at 7:14 PM, abhishek kumar afs.abhis...@gmail.comwrote:
You are given a word and a dictionary. Now propose an algorithm edit
the word (insert
Herllo all,
Plz mail the ebook of Discrete Mathematics and Its Applications, Kenneth
Rosen, if possioble.
Thanks
--
Rahul singhal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Go for 4shared.com there u will find all kind of books
On 16 August 2011 02:23, Rahul Singhal nitk.ra...@gmail.com wrote:
Herllo all,
Plz mail the ebook of Discrete Mathematics and Its Applications, Kenneth
Rosen, if possioble.
Thanks
--
Rahul singhal
--
You received this
--
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
--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more