| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revolver (0) - 1 freq revolve (1) - 2 freq revolved (1) - 1 freq revolves (1) - 1 freq evolve (2) - 7 freq remover (2) - 3 freq recover (2) - 7 freq resolved (2) - 8 freq revolvin (2) - 1 freq resolve (2) - 11 freq evolves (2) - 1 freq evolved (2) - 9 freq devolved (2) - 7 freq rekiver (3) - 1 freq reformer (3) - 2 freq resolvan (3) - 1 freq renoved (3) - 1 freq envolved (3) - 1 freq involve (3) - 16 freq recovert (3) - 10 freq voller (3) - 2 freq treveller (3) - 1 freq revoltit (3) - 1 freq removed (3) - 17 freq treveler (3) - 1 freq |
revolver (0) - 1 freq revolved (2) - 1 freq revolves (2) - 1 freq revolve (2) - 2 freq revolvin (3) - 1 freq resolve (4) - 11 freq devolved (4) - 7 freq evolved (4) - 9 freq evolves (4) - 1 freq resolved (4) - 8 freq evolve (4) - 7 freq remover (4) - 3 freq recover (4) - 7 freq solver (5) - 1 freq reiver (5) - 22 freq revile (5) - 3 freq revived (5) - 6 freq recovery (5) - 13 freq revolts (5) - 1 freq revive (5) - 7 freq devalved (5) - 1 freq devolvit (5) - 1 freq reviled (5) - 2 freq resolvit (5) - 2 freq receever (5) - 1 freq |
SoundEx code - R141 revolver - 1 freq revolved - 1 freq revolvin - 1 freq revolves - 1 freq revolve - 2 freq revolving - 1 freq rplhfcoew - 1 freq |
MetaPhone code - RFLFR revolver - 1 freq |
REVOLVER |
| Time to execute Levenshtein function - 0.231291 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.557180 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.031355 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.081449 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.001302 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. |