Member Avatar for Jishnu

Hi,

There are certain spell-correcting features in search engines like google...

What I want to do is this: If the word entered by the user doesn't match with any of the words in the databases, the program should try to find the word in the database that is closest to the input. How should I calculate the similarity between any two words?

I'm sure there'll be standard algorithms for it... But I don't know the exact names of any of them. Please post the names of the algorithms by which the above task can be accomplished.

Jishnu.

  • 2 Contributors
  • 3 Replies
  • 105 Views
  • 3 Weeks Discussion Span
  • Latest Post Latest Post by Jishnu

Recommended Answers

All 3 Replies

Member Avatar for Jishnu

Thank you Ed. The link you gave was very helpful :)

Member Avatar for Jishnu

Stemming is another algorithm I found to be of interest for similiar purposes.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.