Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
coothier (0) - 2 freq coothie (1) - 4 freq couthie (2) - 71 freq cootie (2) - 1 freq foothie (2) - 3 freq poother (2) - 5 freq clothie (2) - 1 freq moothie (2) - 4 freq scowthier (2) - 1 freq soother (2) - 3 freq cooties (2) - 1 freq crathie (3) - 1 freq bother (3) - 329 freq soothed (3) - 4 freq €˜other (3) - 1 freq abother (3) - 1 freq owther (3) - 5 freq boather (3) - 5 freq coortlie (3) - 2 freq scooter (3) - 9 freq scootie (3) - 2 freq bothie (3) - 9 freq footer (3) - 14 freq conter (3) - 47 freq coatie (3) - 5 freq |
coothier (0) - 2 freq coothie (2) - 4 freq poother (3) - 5 freq cither (3) - 1 freq soother (3) - 3 freq couthie (3) - 71 freq another (4) - 449 freq couthily (4) - 1 freq cathie (4) - 1 freq thier (4) - 3 freq cotter (4) - 3 freq cawther (4) - 1 freq outhir (4) - 1 freq 'other (4) - 1 freq tother (4) - 1 freq other (4) - 579 freq boathir (4) - 3 freq touther (4) - 1 freq souther (4) - 1 freq pouther (4) - 7 freq othir (4) - 1 freq cashier (4) - 1 freq dother (4) - 37 freq poothery (4) - 1 freq mother (4) - 97 freq |
SoundEx code - C360 cater - 5 freq cedar - 4 freq cider - 38 freq cheddar - 6 freq chitter - 14 freq chatter - 14 freq cotter - 3 freq cawdor - 1 freq cheatrie - 1 freq cheater - 1 freq cutter - 5 freq catter - 16 freq catrry - 1 freq cottar - 28 freq cither - 1 freq cetera - 1 freq 'cider - 1 freq cider' - 1 freq chowder - 1 freq chitterie - 1 freq coutar - 1 freq cawther - 1 freq €˜cotter - 1 freq ceterae - 1 freq cattiewurrie - 1 freq cawdour - 1 freq caw-throu - 1 freq coothier - 2 freq cuiter - 1 freq cattery - 8 freq couture - 1 freq cowdary - 1 freq cuter - 1 freq chatrie - 1 freq chittery - 1 freq |
MetaPhone code - K0R gaither - 83 freq gather - 18 freq guthrie - 6 freq gaether - 5 freq gaithery - 8 freq gaethur - 1 freq gaitherie - 2 freq cawther - 1 freq caw-throu - 1 freq coothier - 2 freq g'throu - 1 freq |
COOTHIER |
Time to execute Levenshtein function - 0.198846 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.386289 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.027855 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.000941 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. |