| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wclark (0) - 1 freq clark (1) - 35 freq clare (2) - 12 freq 'clart (2) - 1 freq cark (2) - 6 freq clarke (2) - 7 freq claik (2) - 24 freq i'lark (2) - 1 freq waark (2) - 110 freq clarky (2) - 2 freq clack (2) - 9 freq clerk (2) - 25 freq sjclark (2) - 1 freq clank (2) - 2 freq clarks (2) - 6 freq clart (2) - 40 freq lark (2) - 24 freq clara (2) - 9 freq clak (2) - 2 freq wark (2) - 903 freq warn (3) - 35 freq crak (3) - 4 freq larks (3) - 4 freq trark (3) - 1 freq declare (3) - 25 freq |
wclark (0) - 1 freq clark (2) - 35 freq clarky (3) - 2 freq clarke (3) - 7 freq clerk (3) - 25 freq clart (4) - 40 freq clarks (4) - 6 freq clak (4) - 2 freq clerke (4) - 1 freq wark (4) - 903 freq clank (4) - 2 freq lark (4) - 24 freq clara (4) - 9 freq cark (4) - 6 freq sjclark (4) - 1 freq clare (4) - 12 freq claik (4) - 24 freq 'clart (4) - 1 freq clack (4) - 9 freq waark (4) - 110 freq i'lark (4) - 1 freq work (5) - 674 freq aclock (5) - 1 freq clok (5) - 2 freq clarty (5) - 56 freq |
SoundEx code - W246 weasel-hertit - 1 freq wagglers - 1 freq wclark - 1 freq weeclairemcg - 1 freq |
MetaPhone code - KLRK clark - 35 freq clerk - 25 freq clarke - 7 freq clerke - 1 freq glurk - 1 freq clarky - 2 freq €˜clerk - 1 freq wclark - 1 freq |
WCLARK |
| Time to execute Levenshtein function - 0.387292 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.604355 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.071248 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.047941 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.032057 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. |