| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ullvi (0) - 1 freq levi (2) - 12 freq ull (2) - 24 freq livi (2) - 2 freq llvl (2) - 1 freq zllgi (2) - 1 freq ulls (2) - 1 freq usli (2) - 1 freq uplaid (3) - 1 freq sullen (3) - 7 freq ultra (3) - 4 freq slavs (3) - 1 freq fxlv (3) - 1 freq jslv (3) - 1 freq pulled (3) - 174 freq felli (3) - 2 freq uill (3) - 4 freq dully (3) - 2 freq wullna (3) - 3 freq lexi (3) - 1 freq altai (3) - 2 freq alloa (3) - 4 freq li (3) - 21 freq clive (3) - 9 freq aldi (3) - 9 freq |
ullvi (0) - 1 freq ulls (3) - 1 freq livi (3) - 2 freq llvl (3) - 1 freq levi (3) - 12 freq ull (3) - 24 freq llb (4) - 1 freq ilve (4) - 1 freq lle (4) - 1 freq qlv (4) - 1 freq love (4) - 913 freq solve (4) - 9 freq lev (4) - 1 freq allou (4) - 35 freq ellis (4) - 3 freq lave (4) - 227 freq lvu (4) - 1 freq allah (4) - 1 freq lavy (4) - 3 freq glove (4) - 11 freq iljv (4) - 1 freq ill- (4) - 2 freq allay (4) - 1 freq ills (4) - 36 freq valve (4) - 1 freq |
SoundEx code - U410 ulf - 4 freq ulpa - 1 freq ullvi - 1 freq |
MetaPhone code - ULF ulf - 4 freq ullvi - 1 freq |
ULLVI |
| Time to execute Levenshtein function - 0.573703 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 - 1.102244 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.086642 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.102499 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.001323 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. |