| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resolving (0) - 1 freq resolvin (1) - 1 freq revolving (1) - 1 freq solving (2) - 2 freq revolvin (2) - 1 freq resolvan (2) - 1 freq resolvit (2) - 2 freq solvin (3) - 2 freq resultin (3) - 7 freq retouring (3) - 1 freq resting (3) - 4 freq reworking (3) - 2 freq rescuing (3) - 1 freq devolvin (3) - 2 freq reporting (3) - 2 freq reasoning (3) - 4 freq replying (3) - 3 freq delving (3) - 1 freq restoring (3) - 1 freq reviving (3) - 1 freq rassling (3) - 2 freq evolvin (3) - 1 freq resolve (3) - 11 freq involving (3) - 4 freq recording (3) - 8 freq |
resolving (0) - 1 freq revolving (2) - 1 freq resolvin (2) - 1 freq resolvan (3) - 1 freq solving (3) - 2 freq revolvin (4) - 1 freq resolvit (4) - 2 freq involving (5) - 4 freq rassling (5) - 2 freq reservin (5) - 1 freq resolve (5) - 11 freq rolling (5) - 7 freq resellin (5) - 1 freq reviving (5) - 1 freq resolved (5) - 8 freq wesling (5) - 1 freq receiving (5) - 4 freq restoring (5) - 1 freq solvin (5) - 2 freq rescuing (5) - 1 freq reasoning (5) - 4 freq resting (5) - 4 freq replying (5) - 3 freq resultin (5) - 7 freq delving (5) - 1 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 - RSLFNK resolving - 1 freq |
RESOLVING |
| Time to execute Levenshtein function - 0.342514 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.759667 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.029271 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.074117 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.004150 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. |