| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| club (0) - 262 freq blub (1) - 1 freq clue (1) - 87 freq clug (1) - 1 freq clup (1) - 1 freq club' (1) - 1 freq cub (1) - 3 freq clubs (1) - 104 freq clud (1) - 9 freq crub (1) - 3 freq clung (2) - 14 freq ceud (2) - 1 freq cley (2) - 23 freq clod (2) - 14 freq crumb (2) - 7 freq glut (2) - 5 freq comb (2) - 19 freq csmb (2) - 1 freq blab (2) - 3 freq epub (2) - 1 freq slut (2) - 5 freq cloud (2) - 71 freq blun (2) - 1 freq clie (2) - 2 freq slum (2) - 5 freq |
club (0) - 262 freq clubs (2) - 104 freq celeb (2) - 3 freq colab (2) - 1 freq cub (2) - 3 freq crub (2) - 3 freq clud (2) - 9 freq clue (2) - 87 freq club' (2) - 1 freq blub (2) - 1 freq clup (2) - 1 freq clug (2) - 1 freq clye (3) - 2 freq claw (3) - 27 freq blob (3) - 4 freq glib (3) - 3 freq clan (3) - 56 freq cled (3) - 34 freq clep (3) - 1 freq cloy (3) - 1 freq clos (3) - 14 freq claus (3) - 17 freq clat (3) - 6 freq lab (3) - 29 freq cler (3) - 1 freq |
SoundEx code - C410 clap - 56 freq club - 262 freq clip - 36 freq clype - 46 freq cliff - 28 freq clep - 1 freq clive - 9 freq clippie - 2 freq chilpy - 2 freq clipe - 9 freq caulf - 2 freq clubby - 1 freq clubbie - 1 freq clappie - 3 freq calf - 12 freq clova - 2 freq celeb - 3 freq calfie - 8 freq 'club' - 1 freq clapp - 1 freq clippie' - 1 freq cullivoe - 1 freq cliv - 1 freq €˜caleb - 1 freq clave - 1 freq clove - 1 freq clup - 1 freq club' - 1 freq cleave - 3 freq cleppy - 1 freq collop - 1 freq clava - 2 freq cliffy - 1 freq 'clap-a - 1 freq clap-a - 1 freq colab - 1 freq cclop - 1 freq collab - 1 freq |
MetaPhone code - KLB club - 262 freq globe - 31 freq glob - 9 freq glebe - 6 freq clubby - 1 freq glib - 3 freq clubbie - 1 freq galba - 1 freq 'club' - 1 freq €˜caleb - 1 freq club' - 1 freq gleb - 1 freq colab - 1 freq collab - 1 freq |
CLUB |
| Time to execute Levenshtein function - 0.183697 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.330609 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.027579 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.036744 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.000928 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. |