| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kivver (0) - 6 freq kivvert (1) - 5 freq kivvers (1) - 5 freq kiver (1) - 5 freq kivvver (1) - 1 freq pivver (1) - 1 freq fivver (1) - 4 freq nivver (1) - 977 freq yivver (1) - 4 freq ivver (1) - 276 freq uvver (2) - 10 freq bovver (2) - 6 freq divvel (2) - 4 freq faivver (2) - 4 freq ivve (2) - 1 freq sivven (2) - 15 freq livvel (2) - 2 freq divven (2) - 1 freq niwver (2) - 6 freq ivvir (2) - 6 freq 'nivver (2) - 3 freq ivvery (2) - 74 freq iver (2) - 312 freq silver (2) - 121 freq kimmer (2) - 6 freq |
kivver (0) - 6 freq fivver (2) - 4 freq nivver (2) - 977 freq pivver (2) - 1 freq ivver (2) - 276 freq yivver (2) - 4 freq kivvver (2) - 1 freq kivvers (2) - 5 freq kivvert (2) - 5 freq kiver (2) - 5 freq ivvir (3) - 6 freq jvver (3) - 1 freq ivvery (3) - 74 freq tvver (3) - 1 freq hivvier (3) - 2 freq kivvered (3) - 2 freq yivvery (3) - 1 freq nivvir (3) - 27 freq bovver (3) - 6 freq uvver (3) - 10 freq faivver (3) - 4 freq kivverin (3) - 2 freq cuvver (3) - 1 freq niver (4) - 851 freq liver (4) - 34 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 |
KIVVER |
| Time to execute Levenshtein function - 0.619510 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 - 1.299756 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.182662 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.113441 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.001186 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. |