| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oncuivert (0) - 1 freq cuivert (2) - 2 freq recuivers (3) - 1 freq cuiver (3) - 4 freq ricuvert (3) - 1 freq onceover (3) - 1 freq onluikers (3) - 1 freq cuivers (3) - 2 freq cuvert (3) - 1 freq discuivert (3) - 1 freq inclinet (4) - 2 freq conceived (4) - 10 freq wnvert (4) - 1 freq concert (4) - 44 freq conceive (4) - 2 freq scaitert (4) - 4 freq chivers (4) - 1 freq unraivelt (4) - 2 freq incummers (4) - 4 freq n'iver (4) - 4 freq cuiverin (4) - 1 freq deleivert (4) - 6 freq neiver (4) - 1 freq recovert (4) - 10 freq snuived (4) - 3 freq |
oncuivert (0) - 1 freq cuivert (3) - 2 freq onceover (4) - 1 freq ricuvert (4) - 1 freq cuvert (4) - 1 freq discuivert (5) - 1 freq covert (5) - 39 freq recovert (5) - 10 freq cuivers (5) - 2 freq cuiver (5) - 4 freq recuivers (5) - 1 freq fivert (6) - 2 freq delivert (6) - 10 freq shivert (6) - 3 freq €˜covert (6) - 3 freq incinerate (6) - 2 freq overt (6) - 4 freq niver (6) - 851 freq occurrt (6) - 1 freq subvert (6) - 1 freq receiver (6) - 4 freq ancient (6) - 110 freq swivert (6) - 1 freq caiver (6) - 1 freq kivert (6) - 4 freq |
SoundEx code - O521 oonexpeckit - 2 freq onicbodie - 1 freq oncuivert - 1 freq onciveilitie - 1 freq on-spoken - 1 freq onexpekkit - 1 freq onceover - 1 freq omzfjvwq - 1 freq onceuponashire - 7 freq omuyjbr - 1 freq onkypzp - 1 freq |
MetaPhone code - ONKFRT oncuivert - 1 freq |
ONCUIVERT |
| Time to execute Levenshtein function - 0.222444 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.367068 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.028224 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.037388 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.000900 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. |