| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kevverage (0) - 1 freq kivverage (1) - 1 freq leverage (2) - 4 freq beverage (2) - 3 freq sewerage (3) - 2 freq coverage (3) - 15 freq beverages (3) - 1 freq average (3) - 29 freq eemage (4) - 18 freq kivver (4) - 6 freq leiterate (4) - 1 freq enrage (4) - 3 freq generate (4) - 4 freq perverse (4) - 5 freq heretage (4) - 1 freq everie (4) - 4 freq verge (4) - 9 freq reverie (4) - 2 freq kivvert (4) - 5 freq leeterate (4) - 9 freq ivverrie (4) - 1 freq reverant (4) - 3 freq everee (4) - 1 freq ceterae (4) - 1 freq never've (4) - 2 freq |
kevverage (0) - 1 freq kivverage (1) - 1 freq beverage (4) - 3 freq leverage (4) - 4 freq kivvert (5) - 5 freq kivverin (5) - 2 freq kivvers (5) - 5 freq kivver (5) - 6 freq kivvered (5) - 2 freq coverage (5) - 15 freq average (5) - 29 freq ivverrie (6) - 1 freq beverages (6) - 1 freq converge (6) - 1 freq verge (6) - 9 freq pivveran (6) - 1 freq ivverie (6) - 25 freq sewerage (6) - 2 freq jvver (7) - 1 freq tvver (7) - 1 freq evvir (7) - 6 freq kivered (7) - 1 freq pivver (7) - 1 freq nevvir (7) - 32 freq several (7) - 46 freq |
SoundEx code - K162 kebbers - 1 freq kivers - 3 freq keepers - 16 freq kivvers - 5 freq kippers - 7 freq keppers - 1 freq keeper's - 4 freq kivverage - 1 freq kvrsliy - 1 freq keepersbaw - 1 freq keepyourgermstoyourself - 1 freq keprsga - 1 freq kevverage - 1 freq |
MetaPhone code - KFRJ coverage - 15 freq 'coverage' - 1 freq kivverage - 1 freq kevverage - 1 freq |
KEVVERAGE |
| Time to execute Levenshtein function - 0.273523 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.478508 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.027586 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.037548 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.000971 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. |