| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loamins (0) - 1 freq loanins (1) - 7 freq gloamin's (2) - 3 freq loanin (2) - 11 freq roamin (2) - 9 freq examins (2) - 3 freq loweins (2) - 1 freq foamin (2) - 4 freq gloamin (2) - 76 freq leanins (2) - 1 freq loanens (2) - 4 freq loomin (2) - 9 freq leavins (2) - 11 freq lawins (2) - 1 freq yoamin (2) - 6 freq loafin (2) - 1 freq loins (2) - 3 freq boomins (2) - 1 freq comins (2) - 4 freq gloaming (2) - 5 freq lodgins (2) - 1 freq leamin (2) - 12 freq loadin (2) - 5 freq looming (2) - 3 freq loasin (2) - 6 freq |
loamins (0) - 1 freq loanins (2) - 7 freq lemans (3) - 1 freq comins (3) - 4 freq lemons (3) - 2 freq leamin (3) - 12 freq boomins (3) - 1 freq lavins (3) - 1 freq moomins (3) - 2 freq loans (3) - 11 freq leains (3) - 3 freq lawins (3) - 1 freq looming (3) - 3 freq loins (3) - 3 freq leanins (3) - 1 freq loweins (3) - 1 freq loanens (3) - 4 freq loomin (3) - 9 freq leavins (3) - 11 freq examins (3) - 3 freq lambies (4) - 4 freq limnins (4) - 1 freq lamont (4) - 8 freq laments (4) - 9 freq loudens (4) - 1 freq |
SoundEx code - L552 lanmines - 1 freq lamingoes - 1 freq lining - 1 freq leniency - 1 freq loanins - 7 freq loaningfoot - 1 freq loaningfit - 2 freq leaning - 6 freq lemon-juice - 1 freq linins - 1 freq lemons - 2 freq luminous - 5 freq loanens - 4 freq looming - 3 freq linings - 2 freq lemans - 1 freq linens - 1 freq limnins - 1 freq loamins - 1 freq lanyon's - 1 freq leninst - 1 freq leanins - 1 freq limeayoungjohnny - 1 freq liamyoung - 1 freq linins - 2 freq leamington - 1 freq |
MetaPhone code - LMNS lemons - 2 freq luminous - 5 freq lemans - 1 freq loamins - 1 freq lambeens - 2 freq |
LOAMINS |
| Time to execute Levenshtein function - 0.204405 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.383710 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.027492 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.037521 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.000865 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. |