Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
liftet (0) - 17 freq liftit (1) - 135 freq lifted (1) - 99 freq lift't (1) - 1 freq lyftet (1) - 2 freq listet (1) - 1 freq licet (2) - 1 freq lichtet (2) - 2 freq gifted (2) - 8 freq tistet (2) - 2 freq lite (2) - 3 freq listen (2) - 491 freq rifted (2) - 1 freq linnet (2) - 1 freq limpet (2) - 5 freq luftit (2) - 7 freq ifter (2) - 1 freq liffey (2) - 2 freq sifted (2) - 1 freq life (2) - 1976 freq life' (2) - 5 freq fiftiet (2) - 1 freq lifit (2) - 2 freq likeet (2) - 2 freq liftcd (2) - 1 freq |
liftet (0) - 17 freq lyftet (1) - 2 freq liftit (1) - 135 freq luftit (2) - 7 freq listet (2) - 1 freq lifitit (2) - 2 freq lifted (2) - 99 freq lift't (2) - 1 freq liltit (3) - 2 freq lfted (3) - 1 freq lafter (3) - 1 freq iftit (3) - 1 freq litt (3) - 2 freq liftan (3) - 3 freq siftit (3) - 1 freq riftit (3) - 1 freq lift (3) - 496 freq lufted (3) - 5 freq liftid (3) - 1 freq lifts (3) - 42 freq liftin (3) - 75 freq listit (3) - 7 freq giftit (3) - 5 freq hiftit (3) - 1 freq lifit (3) - 2 freq |
SoundEx code - L133 liftit - 135 freq lifted - 99 freq luftit - 7 freq lufted - 5 freq lepidodendron - 1 freq lyftet - 2 freq liftet - 17 freq luve-daith - 1 freq lïftit - 3 freq liftid - 1 freq lfted - 1 freq lifitit - 2 freq |
MetaPhone code - LFTT liftit - 135 freq lifted - 99 freq luftit - 7 freq lufted - 5 freq lyftet - 2 freq liftet - 17 freq lighted - 3 freq lïftit - 3 freq liftid - 1 freq lightit - 1 freq lfted - 1 freq lifitit - 2 freq lift't - 1 freq |
LIFTET lift - 496 freq lifts - 42 freq lifted - 99 freq lifting - 3 freq liftit - 135 freq liftin - 75 freq liftan - 3 freq liftet - 17 freq lïft - 32 freq lïftit - 3 freq lift's - 2 freq |
Time to execute Levenshtein function - 0.216409 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.349409 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.028894 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.040478 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.001229 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. |