| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lugars (0) - 1 freq lugar (1) - 4 freq sugars (1) - 2 freq lears (2) - 2 freq lagers (2) - 2 freq lunar (2) - 1 freq ledars (2) - 1 freq luca's (2) - 1 freq sugart (2) - 1 freq luxors (2) - 1 freq liars (2) - 1 freq logans (2) - 1 freq sugar (2) - 88 freq lucas (2) - 2 freq lug's (2) - 1 freq lugs (2) - 411 freq sugary (2) - 11 freq leears (2) - 6 freq ludgers (2) - 4 freq luvers (2) - 12 freq gars (2) - 89 freq cigars (2) - 5 freq rugas (2) - 1 freq lars (2) - 1 freq lams (3) - 2 freq |
lugars (0) - 1 freq lagers (2) - 2 freq lugar (2) - 4 freq sugars (2) - 2 freq leears (3) - 6 freq ludgers (3) - 4 freq lugs (3) - 411 freq lars (3) - 1 freq lug's (3) - 1 freq cigars (3) - 5 freq gars (3) - 89 freq luvers (3) - 12 freq luxors (3) - 1 freq ledars (3) - 1 freq liars (3) - 1 freq lears (3) - 2 freq logans (3) - 1 freq gaurs (4) - 2 freq liggs (4) - 23 freq lawers (4) - 8 freq lacers (4) - 1 freq layers (4) - 21 freq lgaur (4) - 1 freq laters (4) - 12 freq teegars (4) - 1 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 - LKRS liqueurs - 1 freq liquorice - 9 freq loggers - 1 freq laikers' - 1 freq lockers - 4 freq lockars - 2 freq lugars - 1 freq lickers - 2 freq |
LUGARS |
| Time to execute Levenshtein function - 0.185906 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.356005 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.028830 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.037438 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.000951 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. |