Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
couthiest (0) - 1 freq fouthiest (1) - 1 freq southwest (2) - 1 freq couthiness (2) - 1 freq couthie (2) - 70 freq pouties (3) - 1 freq worthies (3) - 4 freq clattiest (3) - 1 freq pouthert (3) - 1 freq couthieness (3) - 2 freq roughest (3) - 3 freq howtiest (3) - 1 freq youthie (3) - 1 freq curriest (3) - 1 freq couches (3) - 2 freq countries (3) - 34 freq south-west (3) - 14 freq chubbiest (3) - 1 freq coothier (3) - 2 freq bothies (3) - 13 freq soothwest (3) - 2 freq costies (3) - 8 freq cutties (3) - 3 freq northies (3) - 9 freq fouthiness (3) - 1 freq |
couthiest (0) - 1 freq fouthiest (2) - 1 freq couthiness (4) - 1 freq couthie (4) - 70 freq southwest (4) - 1 freq couthily (5) - 1 freq coothie (5) - 4 freq totiest (5) - 1 freq southert (5) - 1 freq cooties (5) - 1 freq walthiest (5) - 1 freq toughest (5) - 4 freq comfiest (5) - 1 freq couttie (5) - 12 freq cuithes (5) - 4 freq chist (5) - 68 freq cothous (5) - 9 freq caithess (5) - 1 freq ceuithes (5) - 1 freq eithest (5) - 1 freq cuties (5) - 2 freq cantiest (5) - 2 freq contest (5) - 16 freq tottiest (5) - 6 freq curriest (5) - 1 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.183842 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.381416 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.031306 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.040661 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.000786 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. |