Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kivverage (0) - 1 freq kevverage (1) - 1 freq pivveran (3) - 1 freq kivvers (3) - 5 freq kivvert (3) - 5 freq beverage (3) - 3 freq kivver (3) - 6 freq kivvered (3) - 2 freq leverage (3) - 4 freq average (3) - 29 freq ivverie (3) - 25 freq kivverin (3) - 2 freq ivverrie (3) - 1 freq coverage (3) - 15 freq hivenae (4) - 1 freq pivver (4) - 1 freq 'coverage' (4) - 1 freq ivver (4) - 276 freq nivvers (4) - 1 freq slivverie (4) - 1 freq riverse (4) - 1 freq silverware (4) - 1 freq kivvverin (4) - 1 freq veelage (4) - 12 freq kivered (4) - 1 freq |
kivverage (0) - 1 freq kevverage (1) - 1 freq kivvered (4) - 2 freq kivver (4) - 6 freq kivverin (4) - 2 freq kivvert (4) - 5 freq kivvers (4) - 5 freq ivverie (5) - 25 freq coverage (5) - 15 freq ivverrie (5) - 1 freq average (5) - 29 freq beverage (5) - 3 freq pivveran (5) - 1 freq leverage (5) - 4 freq kiverin (6) - 2 freq kiver (6) - 5 freq kivert (6) - 4 freq converge (6) - 1 freq yivvery (6) - 1 freq fivver (6) - 4 freq nivver (6) - 977 freq pivvered (6) - 1 freq ivvery (6) - 74 freq verge (6) - 9 freq yivver (6) - 4 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 |
KIVVERAGE |
Time to execute Levenshtein function - 0.409276 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.918990 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.058659 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.071517 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.000947 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. |