| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| claithed (0) - 6 freq claithes (1) - 19 freq laithed (1) - 2 freq claithe (1) - 1 freq claethed (1) - 2 freq claiked (2) - 1 freq skaithed (2) - 10 freq claethes (2) - 1 freq claethe (2) - 1 freq claith (2) - 59 freq clashed (2) - 4 freq claithin (2) - 1 freq laither (2) - 2 freq clothed (2) - 2 freq claised (2) - 1 freq claithe'n (2) - 1 freq clathes (2) - 8 freq cliched (2) - 1 freq flaited (2) - 1 freq graithed (2) - 12 freq blaitherd (2) - 1 freq claitht (2) - 1 freq clautched (2) - 1 freq claiths (2) - 3 freq claimed (2) - 35 freq |
claithed (0) - 6 freq claethed (1) - 2 freq claithe (2) - 1 freq clothed (2) - 2 freq laithed (2) - 2 freq claithes (2) - 19 freq clathes (3) - 8 freq cliched (3) - 1 freq claiths (3) - 3 freq clautched (3) - 1 freq claitht (3) - 1 freq clathe (3) - 1 freq claith (3) - 59 freq claethe (3) - 1 freq claethes (3) - 1 freq claithin (3) - 1 freq clashed (3) - 4 freq cleshed (4) - 1 freq clythes (4) - 2 freq clothe (4) - 1 freq claitter (4) - 3 freq clothes (4) - 27 freq clathy (4) - 1 freq loathed (4) - 2 freq clouted (4) - 1 freq |
SoundEx code - C433 childhood's - 3 freq childhood - 37 freq claitht - 1 freq clotted - 1 freq cloodit - 2 freq cleidit - 2 freq cloutit - 2 freq clooded - 2 freq cloudit - 1 freq cloddet - 2 freq clodded - 2 freq cloddit - 1 freq claithed - 6 freq clootie-dumplin - 1 freq clouded - 2 freq clothed - 2 freq clootit - 1 freq collided - 4 freq clouted - 1 freq 'childhood' - 1 freq collatit - 3 freq cauld-watter - 1 freq claethed - 2 freq cluddit - 1 freq cleedit - 1 freq collated - 1 freq childhood - 1 freq claudette - 1 freq |
MetaPhone code - KL0T claitht - 1 freq claithed - 6 freq clothed - 2 freq claethed - 2 freq |
CLAITHED |
| Time to execute Levenshtein function - 0.180075 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.370972 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.027645 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.036704 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.000810 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. |