Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
contacts (0) - 7 freq contacks (1) - 2 freq contracts (1) - 2 freq contact (1) - 83 freq convicts (2) - 1 freq contains (2) - 13 freq connachs (2) - 1 freq contacted (2) - 3 freq consaits (2) - 20 freq contests (2) - 6 freq contracks (2) - 4 freq contack (2) - 37 freq contrasts (2) - 8 freq contract (2) - 26 freq contactit (2) - 5 freq contexts (2) - 15 freq conract (2) - 1 freq contents (2) - 35 freq connects (2) - 4 freq coantact (2) - 1 freq contorts (2) - 1 freq contints (2) - 1 freq converts (3) - 1 freq containt (3) - 2 freq cottar's (3) - 1 freq |
contacts (0) - 7 freq contacks (2) - 2 freq contact (2) - 83 freq contracts (2) - 2 freq connects (3) - 4 freq contexts (3) - 15 freq coantact (3) - 1 freq contints (3) - 1 freq contactit (3) - 5 freq contorts (3) - 1 freq contents (3) - 35 freq convicts (3) - 1 freq contests (3) - 6 freq contacted (3) - 3 freq contack (4) - 37 freq conceits (4) - 2 freq coantents (4) - 1 freq coanvicts (4) - 1 freq contrasts (4) - 8 freq contracks (4) - 4 freq contains (4) - 13 freq conract (4) - 1 freq connachs (4) - 1 freq consaits (4) - 20 freq contract (4) - 26 freq |
SoundEx code - C532 canada's - 1 freq contack - 37 freq context-sensitive - 1 freq conduct - 13 freq chaunts - 2 freq counts - 8 freq contagious - 3 freq condescendin - 5 freq cunts - 193 freq contact - 83 freq cunt's - 24 freq conductin - 3 freq cunts' - 1 freq conducted - 4 freq coantact - 1 freq count's - 2 freq cents - 3 freq context - 79 freq cantiest - 2 freq coonts - 17 freq condescendit - 1 freq cundies - 5 freq chanties - 1 freq contest - 16 freq countess - 8 freq contests - 6 freq chants - 6 freq contackit - 1 freq conductor - 4 freq counties' - 1 freq contestin - 1 freq countyside - 5 freq commedagh - 1 freq commits - 7 freq 'countess - 1 freq coontess - 8 freq comets - 12 freq comet's - 1 freq contactit - 5 freq cantick - 1 freq coontiess - 1 freq candy-stick - 1 freq coonties - 5 freq contigue - 1 freq coont's - 1 freq candy-cane - 1 freq conduck - 4 freq counties - 2 freq conductit - 5 freq condescend - 3 freq cantus - 1 freq condeeshuns - 1 freq condeeshun - 2 freq comatee's - 5 freq €˜context - 1 freq committees - 2 freq contexts - 15 freq condescended - 1 freq cantsmell - 10 freq conduk - 1 freq condukkit - 2 freq cants - 1 freq conduckit - 1 freq commattees - 1 freq condies - 2 freq context- - 1 freq conducive-tae-life - 1 freq conducive - 2 freq contacts - 7 freq condescension - 1 freq cantie-est - 1 freq comatees - 5 freq contacks - 2 freq conductors - 1 freq condescendinly - 1 freq conducks - 4 freq comedic - 1 freq contested - 1 freq comatose - 1 freq comatosed - 1 freq contestant - 1 freq cnuts - 1 freq countesswells - 1 freq coneheids - 1 freq cundeez - 1 freq chnitzel - 1 freq camtacs - 6 freq comedycentraluk - 2 freq chaunties - 1 freq condysendin - 1 freq cnudjhleqr - 1 freq candice - 1 freq contacted - 3 freq cahunts - 1 freq chunts - 4 freq chmets - 1 freq chynowethsusan - 1 freq |
MetaPhone code - KNTKTS contacts - 7 freq |
CONTACTS |
Time to execute Levenshtein function - 0.273224 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.680898 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.031037 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.087297 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.001092 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. |