| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liqueurs (0) - 1 freq liqueur (1) - 2 freq liquids (3) - 2 freq queues (3) - 9 freq cliques (3) - 2 freq squeers (3) - 1 freq lingers (3) - 5 freq liquor (3) - 7 freq livers (3) - 1 freq liners (3) - 2 freq lickers (3) - 2 freq limmers (3) - 4 freq lippers (3) - 9 freq uisers (4) - 17 freq tiers (4) - 5 freq biters (4) - 2 freq nithers (4) - 1 freq pliers (4) - 2 freq lingirs (4) - 1 freq titters (4) - 1 freq squerr (4) - 2 freq quairs (4) - 3 freq figurs (4) - 7 freq liter (4) - 1 freq bilers (4) - 1 freq |
liqueurs (0) - 1 freq liqueur (2) - 2 freq livers (4) - 1 freq liners (4) - 2 freq squeers (4) - 1 freq liquor (4) - 7 freq liquids (4) - 2 freq lears (5) - 2 freq loners (5) - 1 freq laabours (5) - 1 freq eilers (5) - 1 freq lovers (5) - 20 freq lee'rs (5) - 1 freq leirs (5) - 1 freq liars (5) - 1 freq labours (5) - 5 freq lagers (5) - 2 freq lugars (5) - 1 freq layers (5) - 21 freq luxors (5) - 1 freq litres (5) - 3 freq lepers (5) - 4 freq laayers (5) - 30 freq leears (5) - 6 freq leavers (5) - 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 |
LIQUEURS |
| Time to execute Levenshtein function - 0.277190 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.502314 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.033160 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.046067 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.000860 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. |