| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kiver (0) - 5 freq kivver (1) - 6 freq wiver (1) - 1 freq kivert (1) - 4 freq kivers (1) - 3 freq iver (1) - 312 freq niver (1) - 851 freq aiver (1) - 3 freq fiver (1) - 46 freq siver (1) - 2 freq diver (1) - 5 freq liver (1) - 34 freq river (1) - 270 freq airer (2) - 1 freq divert (2) - 17 freq killer (2) - 23 freq givers (2) - 2 freq miner (2) - 7 freq waver (2) - 1 freq sliver (2) - 8 freq sover (2) - 1 freq shiver (2) - 35 freq knives (2) - 19 freq wiser (2) - 26 freq kiarr (2) - 2 freq |
kiver (0) - 5 freq siver (2) - 2 freq fiver (2) - 46 freq liver (2) - 34 freq river (2) - 270 freq kivver (2) - 6 freq aiver (2) - 3 freq diver (2) - 5 freq wiver (2) - 1 freq niver (2) - 851 freq kivert (2) - 4 freq kivers (2) - 3 freq iver (2) - 312 freq aver (3) - 4 freq sever (3) - 3 freq ivir (3) - 33 freq never (3) - 1661 freq ivery (3) - 188 freq ivor (3) - 19 freq ver (3) - 3 freq daiver (3) - 4 freq haiver (3) - 6 freq neiver (3) - 1 freq naver (3) - 3 freq kivered (3) - 1 freq |
SoundEx code - K160 keeper - 44 freq kiver - 5 freq keiper - 1 freq kipper - 5 freq khyber - 1 freq kuiper - 11 freq kivver - 6 freq kivvver - 1 freq kaffir - 2 freq keeper - 1 freq |
MetaPhone code - KFR cover - 147 freq quiver - 6 freq quaver - 2 freq gaffer - 35 freq kiver - 5 freq cuuver - 1 freq quiver' - 1 freq caviar - 11 freq cuiver - 4 freq 'cover - 1 freq kivver - 6 freq gfur - 1 freq caviaar - 1 freq gowfer - 1 freq caviare - 1 freq kivvver - 1 freq kaffir - 2 freq caiver - 1 freq cfar - 1 freq cuvver - 1 freq |
KIVER |
| Time to execute Levenshtein function - 0.218417 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.366173 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.028171 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.037335 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.000887 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. |