| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kivert (0) - 4 freq divert (1) - 17 freq kivvert (1) - 5 freq fivert (1) - 2 freq kiver (1) - 5 freq kivers (1) - 3 freq livert (1) - 1 freq livery (2) - 13 freq inert (2) - 3 freq cuvert (2) - 1 freq taivert (2) - 2 freq river (2) - 270 freq liver (2) - 34 freq divers (2) - 10 freq wnvert (2) - 1 freq wiver (2) - 1 freq fibert (2) - 2 freq divent (2) - 1 freq cuivert (2) - 2 freq dyvert (2) - 1 freq fivers (2) - 3 freq niver (2) - 851 freq aiver (2) - 3 freq iver (2) - 312 freq kivver (2) - 6 freq |
kivert (0) - 4 freq kivers (2) - 3 freq kiver (2) - 5 freq livert (2) - 1 freq divert (2) - 17 freq kivvert (2) - 5 freq fivert (2) - 2 freq favert (3) - 1 freq daivert (3) - 2 freq kivered (3) - 1 freq avert (3) - 1 freq overt (3) - 4 freq kiverin (3) - 2 freq dovert (3) - 9 freq davert (3) - 1 freq havert (3) - 1 freq revert (3) - 4 freq covert (3) - 39 freq kert (3) - 8 freq severt (3) - 1 freq vert (3) - 1 freq advert (3) - 32 freq cuvert (3) - 1 freq taivert (3) - 2 freq dyvert (3) - 1 freq |
SoundEx code - K163 kivert - 4 freq kivvered - 2 freq keybrod - 1 freq keyboards - 3 freq kivered - 1 freq kivvert - 5 freq kie-buirds - 1 freq keyboord - 1 freq keyboard - 17 freq keyburd - 1 freq keybuird - 4 freq keppard - 1 freq keyboords - 1 freq keyboardist - 1 freq keyboard' - 1 freq |
MetaPhone code - KFRT covert - 39 freq covered - 124 freq cuivert - 2 freq cover't - 3 freq kivert - 4 freq quivered - 3 freq kivvered - 2 freq cuver'd - 2 freq cuvert - 1 freq coverit - 6 freq kivered - 1 freq coiffured - 1 freq quavered - 2 freq kivvert - 5 freq coveret - 2 freq gaffered - 1 freq €˜covert - 3 freq “covered - 1 freq qwfrt - 2 freq |
KIVERT |
| Time to execute Levenshtein function - 0.209209 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.375333 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.029396 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.036906 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.000842 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. |