| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| coontback (0) - 1 freq contrack (2) - 3 freq contack (2) - 37 freq contracks (3) - 4 freq contrak (3) - 2 freq coontan (3) - 3 freq contact (3) - 83 freq contract (3) - 26 freq coantact (3) - 1 freq castback (3) - 1 freq contacks (3) - 2 freq comeback (3) - 7 freq soondtrack (3) - 5 freq coont's (4) - 1 freq coonterin (4) - 3 freq convick (4) - 5 freq foodbank (4) - 5 freq andback (4) - 1 freq coortain (4) - 2 freq contra (4) - 2 freq coonty (4) - 11 freq coontiess (4) - 1 freq foontain (4) - 4 freq coontit (4) - 30 freq collieback (4) - 1 freq |
coontback (0) - 1 freq contack (3) - 37 freq contrack (3) - 3 freq castback (4) - 1 freq contacks (5) - 2 freq cantick (5) - 1 freq coantact (5) - 1 freq comeback (5) - 7 freq contrak (5) - 2 freq contract (5) - 26 freq contracks (5) - 4 freq contact (5) - 83 freq collieback (6) - 1 freq cumback (6) - 1 freq unthack (6) - 1 freq countence (6) - 1 freq intack (6) - 1 freq construck (6) - 1 freq conneck (6) - 3 freq cashback (6) - 1 freq conflick (6) - 2 freq contackit (6) - 1 freq conduck (6) - 4 freq cutbacks (6) - 1 freq coenflick (6) - 1 freq |
SoundEx code - C531 cuntybaws - 1 freq cantabile - 1 freq candyfloss - 3 freq coontback - 1 freq contibution - 1 freq centipede - 2 freq cenotaph - 2 freq cantbuythechampionsleague - 1 freq cantfeelmytongue - 1 freq |
MetaPhone code - KNTBK coontback - 1 freq |
COONTBACK |
| Time to execute Levenshtein function - 0.209421 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.341090 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.029021 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.037611 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.000859 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. |