| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liquorice (0) - 9 freq liquor (3) - 7 freq librarie (4) - 1 freq invoice (4) - 5 freq limerick (4) - 7 freq inquirie (4) - 1 freq lidice (4) - 1 freq listerine (4) - 1 freq squarie (4) - 1 freq historie (4) - 74 freq lionize (4) - 1 freq luxurie (4) - 1 freq liquids (4) - 2 freq historic (4) - 290 freq nourice (4) - 3 freq victorie (4) - 9 freq liquidy (4) - 1 freq liquidate (4) - 2 freq figurine (4) - 2 freq aiulice (4) - 1 freq likewice (4) - 2 freq liquid (4) - 29 freq liquit (4) - 1 freq i'rice (4) - 1 freq lexiprice (4) - 1 freq |
liquorice (0) - 9 freq liquor (4) - 7 freq i'rice (6) - 1 freq lexiprice (6) - 1 freq liquit (6) - 1 freq divorce (6) - 15 freq aiulice (6) - 1 freq likewice (6) - 2 freq liquid (6) - 29 freq maurice (6) - 4 freq lyric (6) - 6 freq eloquence (6) - 3 freq liqueur (6) - 2 freq liqueurs (6) - 1 freq liquidate (6) - 2 freq morice (6) - 1 freq lurie (6) - 1 freq airforce (6) - 2 freq literacy (6) - 34 freq squarie (6) - 1 freq lidice (6) - 1 freq limerick (6) - 7 freq luxurie (6) - 1 freq inquirie (6) - 1 freq liquids (6) - 2 freq |
SoundEx code - L262 lacers - 1 freq lagers - 2 freq lasers - 2 freq liqueurs - 1 freq lazarus - 20 freq liquorice - 9 freq luxourious - 1 freq losers - 3 freq lager's - 1 freq loggers - 1 freq laikers' - 1 freq lecherous - 2 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 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 |
LIQUORICE |
| Time to execute Levenshtein function - 0.177317 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.474660 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.027612 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.074722 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.000841 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. |