| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| couthiest (0) - 1 freq fouthiest (1) - 1 freq couthiness (2) - 1 freq couthie (2) - 71 freq southwest (2) - 1 freq counties (3) - 2 freq soothwest (3) - 2 freq fouthie (3) - 16 freq couches (3) - 2 freq southert (3) - 1 freq coothier (3) - 2 freq tottiest (3) - 6 freq couthily (3) - 1 freq toughest (3) - 4 freq roughest (3) - 3 freq bothies (3) - 13 freq courie't (3) - 1 freq cuties (3) - 2 freq couriet (3) - 1 freq cutties (3) - 3 freq cooties (3) - 1 freq curriest (3) - 1 freq totiest (3) - 1 freq costies (3) - 8 freq northies (3) - 9 freq |
couthiest (0) - 1 freq fouthiest (2) - 1 freq couthie (4) - 71 freq southwest (4) - 1 freq couthiness (4) - 1 freq clattiest (5) - 1 freq couthieness (5) - 2 freq chest (5) - 101 freq cantiest (5) - 2 freq coothie (5) - 4 freq pouthert (5) - 1 freq contest (5) - 16 freq couttie (5) - 12 freq ceuithes (5) - 1 freq caithess (5) - 1 freq cuithes (5) - 4 freq chist (5) - 68 freq eithest (5) - 1 freq cothous (5) - 9 freq totiest (5) - 1 freq walthiest (5) - 1 freq comfiest (5) - 1 freq cutties (5) - 3 freq couches (5) - 2 freq soothwest (5) - 2 freq |
SoundEx code - C323 couthiest - 1 freq cheetie-cat - 3 freq cutty-stool - 1 freq cotched - 6 freq catched - 83 freq catcht - 37 freq catchit - 8 freq catchet - 5 freq catastrophe - 1 freq cat-astrophe - 1 freq catastrophic - 1 freq cotside - 1 freq cthocht - 1 freq code-switchin - 5 freq catastrophes - 1 freq cadged - 1 freq €œcode-switching - 1 freq caitqdfv - 1 freq ckeduuqdrk - 1 freq c-dicht - 1 freq |
MetaPhone code - K0ST couthiest - 1 freq |
COUTHIEST |
| Time to execute Levenshtein function - 0.275936 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.534071 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.036000 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.044211 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.001109 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. |