| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| komplettwayne (0) - 1 freq omelette (6) - 3 freq compluterance (6) - 2 freq completion (6) - 4 freq completely (6) - 85 freq complaynt (6) - 1 freq complection (6) - 1 freq compleenan (6) - 1 freq completing (6) - 2 freq completelyjane (6) - 1 freq complenand (6) - 1 freq milestane (6) - 2 freq complete (6) - 109 freq competan (6) - 2 freq comperande (7) - 1 freq complimentarie (7) - 1 freq competitive (7) - 9 freq millstane (7) - 2 freq competence (7) - 5 freq compleinin (7) - 1 freq milestone (7) - 2 freq compleen (7) - 5 freq someane (7) - 17 freq oncertane (7) - 1 freq complicate (7) - 4 freq |
komplettwayne (0) - 1 freq complection (9) - 1 freq completelyjane (9) - 1 freq completion (9) - 4 freq competan (10) - 2 freq completit (10) - 8 freq templeton (10) - 2 freq simpleton (10) - 2 freq plettin (10) - 1 freq complutherin (10) - 1 freq complete (10) - 109 freq milestane (10) - 2 freq compluterance (10) - 2 freq complaynt (10) - 1 freq omelette (10) - 3 freq compleenan (10) - 1 freq competition (10) - 61 freq completing (10) - 2 freq completely (10) - 85 freq lettan (11) - 1 freq glettan (11) - 1 freq kempton (11) - 4 freq complicatioun (11) - 1 freq complents (11) - 1 freq compliant (11) - 1 freq |
SoundEx code - K514 knobbly - 4 freq kinfolk - 1 freq kennable - 3 freq kneevlick - 1 freq knablich - 1 freq kenable - 19 freq knobble - 4 freq kenably - 6 freq kimblecheat - 1 freq komplettwayne - 1 freq |
MetaPhone code - KMPLTWN komplettwayne - 1 freq |
KOMPLETTWAYNE |
| Time to execute Levenshtein function - 0.220264 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.387948 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.028511 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.037048 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.000764 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. |