Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lesser-uised (0) - 5 freq lesser-used (1) - 1 freq lesser-yaised (2) - 2 freq weel-uised (4) - 1 freq mesmereised (4) - 1 freq mesmerised (4) - 8 freq lessened (5) - 1 freq generalised (5) - 1 freq desseruit (5) - 1 freq ower-uise (5) - 1 freq exercised (5) - 5 freq pressurised (5) - 1 freq letter-huird (5) - 2 freq energised (5) - 3 freq better-suited (5) - 1 freq leisur-like (5) - 1 freq weel-used (5) - 1 freq neutralised (6) - 1 freq recruited (6) - 2 freq sisterhuid (6) - 1 freq ower-sized (6) - 1 freq bruised (6) - 15 freq leered (6) - 1 freq weel-yaised (6) - 2 freq lear-time (6) - 4 freq |
lesser-uised (0) - 5 freq lesser-used (1) - 1 freq lesser-yaised (2) - 2 freq mesmereised (7) - 1 freq mesmerised (7) - 8 freq pressurised (8) - 1 freq leisur-like (8) - 1 freq weel-uised (8) - 1 freq lessened (8) - 1 freq leisured (9) - 1 freq ill-uised (9) - 1 freq casseroled (9) - 1 freq assuired (9) - 1 freq fossilised (9) - 2 freq ostracised (9) - 1 freq lesson-buik (9) - 1 freq possessed (9) - 14 freq blessesd (9) - 1 freq lassie-like (9) - 1 freq lessens (9) - 1 freq unsupervised (9) - 1 freq laser-guidit (9) - 1 freq possesed (9) - 1 freq stardised (9) - 1 freq lessuns (9) - 1 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 - LSRST lesser-used - 1 freq lesser-uised - 5 freq |
LESSER-UISED |
Time to execute Levenshtein function - 0.242383 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.439483 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.029631 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.038444 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.000884 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. |