| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lazybeds (0) - 3 freq laayers (3) - 30 freq labels (3) - 6 freq maybees (3) - 1 freq layed (3) - 16 freq lawyers (3) - 19 freq lazybones (3) - 1 freq lambed (3) - 2 freq laziness (3) - 1 freq ladybirds (3) - 1 freq lambegs (3) - 1 freq layers (3) - 21 freq maybes (3) - 50 freq larbert (4) - 2 freq larners (4) - 10 freq labsters (4) - 9 freq lancers (4) - 4 freq laayer (4) - 5 freq lyness (4) - 1 freq hazy-eyes (4) - 1 freq latimes (4) - 1 freq lanyon's (4) - 1 freq barbed (4) - 4 freq lambeens (4) - 2 freq wazzie's (4) - 1 freq |
lazybeds (0) - 3 freq lazybones (4) - 1 freq laziness (5) - 1 freq ladybirds (5) - 1 freq lambegs (5) - 1 freq lizards (5) - 4 freq lambed (5) - 2 freq labels (5) - 6 freq rosebeds (6) - 1 freq labs (6) - 3 freq libbed (6) - 1 freq leeds (6) - 9 freq laudies (6) - 1 freq ladies (6) - 54 freq lumbers (6) - 3 freq lieds (6) - 1 freq laands (6) - 2 freq laddies (6) - 198 freq lambies (6) - 4 freq lads (6) - 508 freq lizzie's (6) - 9 freq laads (6) - 7 freq lairds (6) - 28 freq lozens (6) - 1 freq lauds (6) - 1 freq |
SoundEx code - L213 leezaveta's - 1 freq lochfit - 2 freq lick-spittle - 2 freq legbiter - 2 freq lickspittle - 4 freq lickspittles - 2 freq lïzbeth - 13 freq lïzbeth's - 1 freq lazybeds - 3 freq leezabeth - 1 freq lisped - 1 freq lgbt - 4 freq lgbtq - 1 freq lgbtqi - 1 freq lazyfatgingerprick - 1 freq lgbti-inclusive - 1 freq lysbeth - 1 freq lgbtqiap - 1 freq lzsfd - 1 freq |
MetaPhone code - LSBTS lazybeds - 3 freq |
LAZYBEDS |
| Time to execute Levenshtein function - 0.466374 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.679367 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.032804 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.073582 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.001051 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. |