Checking spelling errors..Any ideas?

[new_coder]

Hi,

I am trying to do the following.

I am given a file which contains an accepted wordlist.
And there is another input file containing a sentence (all in lowercase)

I am supposed to find out whether the words in input file are from accepted wordlist. If not then the program must print out the minimum number of changes necessary to turn all words in the input wall post into accepted words as defined by the word list file. Words may not be joined together, or separated into multiple words. A change in a word is defined as one of the following:

1. Replacing any single letter with another letter.
2. Adding a single letter in any position.
3. Removing any single letter.

please help me with some ideas......

esp with...if a word is not from the accepted list, then how do u find the closest word to it?

[new_coder]

Example:

Input file contains this:

tihs sententcnes iss nout varrry goud


the output shud be an integer indicating number of changes

[new_coder]

i guess i got the answer...this is the algo

csse.monash .edu.au/~lloyd/tildeAlgDS/Dynamic/Edit/]Dynamic Programming Algorithm, Edit Distance[/url]

[Fubarable]

I'm less than a newbie in this type of algorithm, but I can help with posting a functioning link to the very interesting article that you mentioned above. Many thanks for sharing it with us!
Dynamic Programming Algorithm, Edit Distance

[dlorde]

Cool - it is a tricky challenge even for relatively short lists.

Thanks for the link.

[new_coder]

@Fubarable

how did you post the hyperlink? i am new to these forums so just curious.

[Fubarable]

new coder, it's a secret that I'm not allowed to tell you until you've posted 20 posts.

....OK, actually it's a "feature" of the forum that prevents newbies from posting links until they've posted 20 posts. Before we had this we were getting more and more porn-spam posts. Keep posting and you'll soon reach the 20 limit. Sorry for the inconvenience.

[new_coder]

ok thanks anyways :)