Closed it-is-hacker-time closed 6 years ago
There are several similarities implemented in the library. The main idea would be to compute features for the strings and then the similarity should be computed based on the features.
If you want to try some experimental feature in the develop branch there is a KDTree implemented which can return the k-nearest neighbors in a set of documents.
What algoritm should I use to find the closest match from a string to a set of strings.
Example of known inputs:
Input I wanna match up and find most similiar, in case there are any similar (in this example there are just spelling mistakes):