| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lapels (0) - 1 freq lapel (1) - 3 freq labels (1) - 6 freq lames (2) - 1 freq lade's (2) - 1 freq daels (2) - 9 freq label (2) - 57 freq lacers (2) - 1 freq laegs (2) - 3 freq lepers (2) - 4 freq pape's (2) - 1 freq lael (2) - 6 freq lates (2) - 2 freq camels (2) - 4 freq apes (2) - 4 freq lapert (2) - 1 freq labelt (2) - 2 freq gapes (2) - 1 freq haels (2) - 1 freq hazels (2) - 2 freq lakes (2) - 2 freq gaels (2) - 17 freq laves (2) - 3 freq panels (2) - 15 freq apees (2) - 1 freq |
lapels (0) - 1 freq labels (2) - 6 freq lapel (2) - 3 freq laurels (3) - 2 freq lepers (3) - 4 freq lapis (3) - 1 freq laps (3) - 7 freq levels (3) - 66 freq lulls (4) - 2 freq lups (4) - 1 freq puls (4) - 4 freq lokals (4) - 1 freq apples (4) - 10 freq aipils (4) - 1 freq plaes (4) - 1 freq lupins (4) - 4 freq levils (4) - 1 freq yalls (4) - 2 freq chapels (4) - 2 freq japers (4) - 15 freq lakely (4) - 2 freq lanes (4) - 11 freq lawers (4) - 8 freq lagers (4) - 2 freq capers (4) - 7 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveliest - 6 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq level-crossin - 1 freq levels' - 1 freq lifelessness - 1 freq lyfie-lik - 1 freq leevils - 1 freq leevels - 1 freq leaf-lik - 1 freq levils - 1 freq liwuplxrqr - 1 freq levels - 1 freq leavealightonforscotland - 1 freq loopholes - 1 freq |
MetaPhone code - LPLS lapels - 1 freq |
LAPELS |
| Time to execute Levenshtein function - 0.252742 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.627416 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.071136 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.044570 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.000908 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. |