| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lacers (0) - 1 freq lawers (1) - 8 freq layers (1) - 21 freq acers (1) - 1 freq lancers (1) - 4 freq laces (1) - 11 freq lagers (1) - 2 freq laters (1) - 12 freq racers (1) - 1 freq lasers (1) - 2 freq spacers (2) - 2 freq facets (2) - 2 freq lars (2) - 1 freq lalors (2) - 1 freq savers (2) - 1 freq landers (2) - 10 freq losers (2) - 3 freq wavers (2) - 1 freq taers (2) - 19 freq slayers (2) - 2 freq aers (2) - 2 freq leavers (2) - 1 freq larners (2) - 10 freq balers (2) - 1 freq lawert (2) - 1 freq |
lacers (0) - 1 freq laters (2) - 12 freq racers (2) - 1 freq lagers (2) - 2 freq ulcers (2) - 1 freq lasers (2) - 2 freq lawers (2) - 8 freq laces (2) - 11 freq layers (2) - 21 freq acers (2) - 1 freq lancers (2) - 4 freq glaciers (3) - 2 freq leaders (3) - 30 freq livers (3) - 1 freq caers (3) - 1 freq saucers (3) - 6 freq lacks (3) - 9 freq lepers (3) - 4 freq laayers (3) - 30 freq lockers (3) - 4 freq liners (3) - 2 freq lackeys (3) - 3 freq luvers (3) - 12 freq lachs (3) - 3 freq lickers (3) - 2 freq |
SoundEx code - L262 lacers - 1 freq lagers - 2 freq lasers - 2 freq liqueurs - 1 freq lecherous - 3 freq lazarus - 20 freq liquorice - 9 freq luxourious - 1 freq losers - 3 freq lager's - 1 freq loggers - 1 freq laikers' - 1 freq lockers - 4 freq laser-guidit - 1 freq lockars - 2 freq loughriescouse - 2 freq leckerstanes - 1 freq leuchars - 1 freq luxuries - 3 freq luxors - 1 freq lugars - 1 freq laigersay - 2 freq lesser-used - 1 freq lesser-uised - 5 freq lousers - 1 freq lesser-yaised - 2 freq liquorish - 1 freq lkkryzgv - 1 freq legiawarszawa - 1 freq lickers - 2 freq lkrwzb - 1 freq |
MetaPhone code - LSRS lacers - 1 freq lasers - 2 freq lazarus - 20 freq losers - 3 freq lousers - 1 freq |
LACERS |
| Time to execute Levenshtein function - 0.203408 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.398148 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.028627 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.041500 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.000987 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. |