| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lthvf (0) - 4 freq lthv (1) - 2 freq nthf (2) - 1 freq luvf (2) - 1 freq thof (2) - 4 freq lethal (3) - 3 freq lha (3) - 1 freq utv (3) - 1 freq ther (3) - 111 freq the' (3) - 572 freq mmhxf (3) - 1 freq tham (3) - 43 freq 'th- (3) - 1 freq lyf (3) - 3 freq tevc (3) - 1 freq hthy (3) - 1 freq luther (3) - 9 freq laff (3) - 7 freq luv (3) - 183 freq 'than (3) - 1 freq luiv (3) - 7 freq thev (3) - 3 freq love (3) - 913 freq thoa (3) - 4 freq thavm (3) - 4 freq |
lthvf (0) - 4 freq lthv (2) - 2 freq thof (4) - 4 freq luvf (4) - 1 freq nthf (4) - 1 freq theve (5) - 1 freq lithca (5) - 1 freq lethe (5) - 2 freq altho' (5) - 2 freq oltrvx (5) - 1 freq lyth (5) - 1 freq lithy (5) - 1 freq althar (5) - 5 freq lether (5) - 2 freq lithe (5) - 5 freq 'thief (5) - 2 freq lith (5) - 1 freq lither (5) - 1 freq lathie (5) - 1 freq lathes (5) - 1 freq thuv (5) - 5 freq liths (5) - 2 freq lythe (5) - 4 freq thavm (5) - 4 freq altho (5) - 38 freq |
SoundEx code - L310 lit-app - 4 freq let-up - 1 freq let-be - 1 freq laithfu - 1 freq latib - 1 freq lead-up - 1 freq ldup - 1 freq ldf - 1 freq leidfu - 1 freq lthvf - 4 freq lthv - 2 freq |
MetaPhone code - L0FF lthvf - 4 freq |
LTHVF |
| Time to execute Levenshtein function - 0.346459 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.558847 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.042560 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.055760 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.001157 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. |