| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clachans (0) - 30 freq clachan (1) - 101 freq clashan (2) - 2 freq clackan (2) - 1 freq lochans (2) - 8 freq clauchan (2) - 1 freq claimants (3) - 2 freq coaching (3) - 13 freq clackin (3) - 15 freq clappan (3) - 2 freq 'lallans (3) - 1 freq coach's (3) - 1 freq cleans (3) - 9 freq clathin (3) - 1 freq lashins (3) - 3 freq clathes (3) - 8 freq claichin (3) - 1 freq clockens (3) - 1 freq lallans (3) - 136 freq reachan (3) - 3 freq clankan (3) - 1 freq coachman (3) - 3 freq clangan (3) - 1 freq chamchars (3) - 1 freq lashan (3) - 1 freq |
clachans (0) - 30 freq clachan (2) - 101 freq lochans (3) - 8 freq clauchan (3) - 1 freq clashan (4) - 2 freq clauchts (4) - 2 freq claichin (4) - 1 freq clockens (4) - 1 freq clackan (4) - 1 freq 'clochan' (5) - 1 freq clichés (5) - 3 freq catchan (5) - 12 freq blichan (5) - 1 freq laachan (5) - 2 freq lauchan (5) - 2 freq clatchin (5) - 1 freq coachin (5) - 1 freq clutchan (5) - 1 freq cleuchs (5) - 5 freq tulachan (5) - 1 freq lachin (5) - 46 freq clartians (5) - 2 freq lachs (5) - 3 freq coaches (5) - 9 freq lochan's (5) - 3 freq |
SoundEx code - C425 cleckin - 13 freq clishmaclaivers - 2 freq clachan - 101 freq clekkin - 11 freq clasin - 1 freq claichin - 1 freq collision - 5 freq clashin - 9 freq callishang - 1 freq clicking - 3 freq classmates - 2 freq colluseum - 1 freq clashmaclaver - 1 freq clockin - 10 freq collieshangie - 15 freq claikin - 11 freq cologne - 3 freq collegianer - 37 freq closin - 27 freq cloakin - 1 freq clickin - 13 freq clauchan - 1 freq close-mooths - 1 freq colquhonnie - 1 freq clachans - 30 freq cluckin - 2 freq clishmaclavers - 2 freq closing - 8 freq clocking - 1 freq cleukin - 2 freq cullisien - 1 freq claiken - 1 freq coalescence - 2 freq close-eein - 1 freq clackin - 15 freq callcentre - 1 freq colosseum - 2 freq coliseum - 1 freq cloggin - 2 freq colloguin - 7 freq colleckin - 1 freq clackan - 1 freq cleekin - 11 freq colossians - 1 freq cluckan - 1 freq closeen - 2 freq clickan - 2 freq collegianers - 19 freq clekkins - 1 freq clossan - 2 freq clashan - 2 freq claikan - 1 freq cluckeens - 1 freq clickeen - 1 freq clagging - 1 freq clish-ma-claver - 2 freq clagginess - 1 freq clossmid - 1 freq callyshang - 1 freq cleikin - 4 freq cuailgne - 1 freq clish-maclaver - 1 freq cleikins - 1 freq collegian - 1 freq 'clishmaclaivers' - 1 freq collieshangies - 2 freq claagin - 2 freq closin' - 1 freq closemouths - 1 freq clishmaclaverin - 1 freq colloguein - 1 freq clokkin - 1 freq closeness - 2 freq clishmaclash - 1 freq chalkin - 1 freq callaghan - 6 freq collieshange - 1 freq clessmates - 1 freq clockens - 1 freq cleeshin - 1 freq collusion - 1 freq cullykhan - 1 freq clickimin - 1 freq cwlcymro - 1 freq clishnaclaver - 4 freq caljamieson - 6 freq clakkin - 1 freq coulson - 2 freq culzean - 1 freq cowlickin - 1 freq clecshin - 1 freq clishmaclavers' - 1 freq chloeejcampbell - 1 freq 'clochan' - 1 freq |
MetaPhone code - KLXNS galoshans - 1 freq clachans - 30 freq coalitions - 1 freq |
CLACHANS |
| Time to execute Levenshtein function - 0.257092 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.417263 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.028636 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.040075 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.000874 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. |