| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| life-jaickets (0) - 1 freq lifejacket (3) - 1 freq lyfejacket (4) - 1 freq jaickets (5) - 18 freq life-cless (5) - 1 freq life-thochts (5) - 1 freq free-mairket (6) - 1 freq life-time (6) - 1 freq luve-aiples (6) - 1 freq lifetimes (6) - 5 freq life-cell (6) - 2 freq limericks (6) - 1 freq life-watter (6) - 1 freq jaikets (6) - 13 freq lifetime's (6) - 5 freq supermairkets (6) - 2 freq white-jaiketed (6) - 1 freq life-tinkin (6) - 1 freq life-cycle (6) - 1 freq jaicket (6) - 72 freq jackets (6) - 3 freq literacies (6) - 1 freq coal-backets (6) - 1 freq wage-packet (6) - 1 freq life-wat (6) - 1 freq |
life-jaickets (0) - 1 freq lifejacket (5) - 1 freq lyfejacket (6) - 1 freq life-thochts (8) - 1 freq life-cless (8) - 1 freq jaickets (8) - 18 freq life-bocht (9) - 1 freq coal-backets (9) - 1 freq jackets (9) - 3 freq life-cells (9) - 3 freq lyme-lichts (9) - 1 freq ee-sockets (9) - 1 freq wage-packet (10) - 1 freq life-wat (10) - 1 freq lifeboats (10) - 2 freq hijackers (10) - 1 freq bone-pickers (10) - 1 freq jaicket's (10) - 1 freq life-mate (10) - 1 freq life-tinkin (10) - 1 freq limericks (10) - 1 freq life-cell (10) - 2 freq jeckets (10) - 1 freq life-time (10) - 1 freq jaicket (10) - 72 freq |
SoundEx code - L122 life-size - 2 freq lyfejacket - 1 freq lifejacket - 1 freq life-jaickets - 1 freq life-sized - 1 freq lovesick - 2 freq life-cycle - 1 freq luve-seik - 4 freq lvcocktvr - 1 freq loveiyjess - 1 freq livvzezhz - 1 freq lpcugpmsnp - 1 freq |
MetaPhone code - LFJKTS life-jaickets - 1 freq |
LIFE-JAICKETS |
| Time to execute Levenshtein function - 0.220561 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.407132 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.028074 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.041152 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.000932 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. |