| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resolvin (0) - 1 freq resolvit (1) - 2 freq resolvan (1) - 1 freq revolvin (1) - 1 freq resolving (1) - 1 freq revolving (2) - 1 freq resolved (2) - 8 freq reservin (2) - 1 freq evolvin (2) - 1 freq solvin (2) - 2 freq resolve (2) - 11 freq resultin (2) - 7 freq revoltin (2) - 1 freq devolvin (2) - 2 freq resellin (2) - 1 freq resortin (2) - 3 freq removin (2) - 5 freq resourcin (3) - 5 freq devolvit (3) - 1 freq retellin (3) - 4 freq removit (3) - 1 freq reivin (3) - 13 freq kelvin (3) - 8 freq restrain (3) - 2 freq revellin (3) - 3 freq |
resolvin (0) - 1 freq resolvan (1) - 1 freq revolvin (2) - 1 freq resolving (2) - 1 freq resolvit (2) - 2 freq resolve (3) - 11 freq resultin (3) - 7 freq resellin (3) - 1 freq solvin (3) - 2 freq reservin (3) - 1 freq resolved (3) - 8 freq relivin (4) - 1 freq relievin (4) - 3 freq resultan (4) - 1 freq removin (4) - 5 freq roslin (4) - 1 freq devolvin (4) - 2 freq revoltin (4) - 1 freq resortin (4) - 3 freq evolvin (4) - 1 freq revolving (4) - 1 freq resolution (4) - 19 freq dissolvin (5) - 2 freq colvin (5) - 1 freq delvin (5) - 3 freq |
SoundEx code - R241 resolve - 11 freq resolved - 8 freq rockliffe - 1 freq resolvit - 2 freq recleeved - 1 freq resolvan - 1 freq resslova - 2 freq rickle-o-banes - 1 freq rage-levels - 1 freq resolvin - 1 freq rqzlavszi - 1 freq resolving - 1 freq |
MetaPhone code - RSLFN resolvan - 1 freq resolvin - 1 freq |
RESOLVIN |
| Time to execute Levenshtein function - 0.380081 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.546906 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.060745 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.038226 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001133 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |