| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lrmy (0) - 1 freq ermy (1) - 2 freq army (1) - 82 freq 'my (2) - 41 freq triy (2) - 2 freq tray (2) - 48 freq armt (2) - 2 freq cry (2) - 369 freq lyme (2) - 1 freq lumi (2) - 2 freq lums (2) - 34 freq lime (2) - 29 freq brey (2) - 1 freq lnm (2) - 1 freq dry (2) - 472 freq lym (2) - 1 freq limb (2) - 14 freq limp (2) - 20 freq rmp (2) - 1 freq lacy (2) - 6 freq lump (2) - 62 freq barmy (2) - 2 freq qrme (2) - 1 freq lory (2) - 42 freq elroy (2) - 2 freq |
lrmy (0) - 1 freq army (2) - 82 freq ermy (2) - 2 freq lr (3) - 5 freq arm (3) - 52 freq wormy (3) - 1 freq lama (3) - 17 freq drmo (3) - 3 freq alarm (3) - 42 freq limo (3) - 9 freq lume (3) - 1 freq lrc (3) - 1 freq lrq (3) - 1 freq ljm (3) - 1 freq lum (3) - 140 freq lame (3) - 10 freq krmu (3) - 1 freq rmu (3) - 1 freq armoy (3) - 1 freq lamm (3) - 3 freq ormo (3) - 2 freq nrm (3) - 3 freq lima (3) - 2 freq lam (3) - 1 freq prma (3) - 1 freq |
SoundEx code - L650 learn - 294 freq lorina - 3 freq lourin - 8 freq lern - 3 freq leerin - 5 freq lairn - 134 freq lowerin - 12 freq lorraine - 6 freq larne - 19 freq lorne - 6 freq learin - 8 freq lairne - 2 freq larn - 16 freq lorna - 20 freq lauren - 21 freq laureen - 4 freq laern - 13 freq leirin - 1 freq lurno - 1 freq lerne - 1 freq lairin - 2 freq lorn - 1 freq luewarm - 1 freq layerin - 1 freq leern - 1 freq louran - 1 freq lowrin - 2 freq lerrum - 3 freq lerrin' - 1 freq lew-warm - 1 freq lerone - 1 freq learn - 1 freq laren - 21 freq laren - 1 freq laran - 2 freq lairn - 2 freq learn - 1 freq leirna - 1 freq lornawi - 2 freq 'lorne - 1 freq lwrni - 1 freq lrmy - 1 freq lorrain - 1 freq |
MetaPhone code - LRM lerrum - 3 freq lrmy - 1 freq |
LRMY |
| Time to execute Levenshtein function - 0.204456 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.397562 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.029293 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.041999 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.001179 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. |