| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| revive (0) - 7 freq reive (1) - 5 freq revile (1) - 3 freq revived (1) - 6 freq revise (1) - 6 freq relive (1) - 1 freq crevice (2) - 2 freq revised (2) - 2 freq reeve (2) - 1 freq reviled (2) - 2 freq reiver (2) - 22 freq recipe (2) - 33 freq derive (2) - 2 freq receive (2) - 21 freq reine (2) - 2 freq retire (2) - 10 freq deive (2) - 1 freq recite (2) - 9 freq belive (2) - 2 freq review (2) - 71 freq evie (2) - 8 freq device (2) - 23 freq eelive (2) - 1 freq resile (2) - 1 freq devide (2) - 1 freq |
revive (0) - 7 freq revise (2) - 6 freq revived (2) - 6 freq relive (2) - 1 freq revile (2) - 3 freq reive (2) - 5 freq veive (3) - 5 freq rive (3) - 18 freq revere (3) - 1 freq remove (3) - 12 freq reived (3) - 5 freq revivit (3) - 1 freq reives (3) - 2 freq revolve (3) - 2 freq review (3) - 71 freq revival (3) - 56 freq relieve (3) - 2 freq remuive (3) - 4 freq revote (3) - 1 freq receive (3) - 21 freq reeve (3) - 1 freq reiver (3) - 22 freq rivvi (3) - 1 freq rove (4) - 2 freq arrive (4) - 51 freq |
SoundEx code - R110 rebuff - 2 freq revive - 7 freq rip-aff - 3 freq re-bop - 1 freq rrvob - 1 freq rbib - 1 freq |
MetaPhone code - RFF revive - 7 freq rfv - 1 freq |
REVIVE |
| Time to execute Levenshtein function - 0.171889 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.354719 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.027024 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.036881 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.000823 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. |