| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tjvjzkb (0) - 1 freq jjkb (3) - 1 freq pvjzn (4) - 1 freq kvjhvb (4) - 1 freq ojjz (4) - 1 freq tvj (4) - 2 freq tavok (4) - 1 freq jsjz (4) - 1 freq hjtkb (4) - 1 freq xojkb (4) - 1 freq iehjzb (4) - 1 freq bvjxb (4) - 1 freq jjb (4) - 1 freq tjrezacb (4) - 1 freq tveuk (4) - 1 freq trojsky (4) - 1 freq thijob (4) - 1 freq tpqjrb (4) - 1 freq ijzcb (4) - 1 freq ajjkt (4) - 1 freq jsizt (5) - 1 freq jinky (5) - 5 freq juikt (5) - 2 freq trunks (5) - 9 freq jizzen (5) - 4 freq |
tjvjzkb (0) - 1 freq jjkb (6) - 1 freq tjrezacb (7) - 1 freq tveuk (8) - 1 freq jjb (8) - 1 freq thijob (8) - 1 freq ijzcb (8) - 1 freq tojvkat (8) - 1 freq ajjkt (8) - 1 freq bvjxb (8) - 1 freq tpqjrb (8) - 1 freq trojsky (8) - 1 freq ojjz (8) - 1 freq iehjzb (8) - 1 freq pvjzn (8) - 1 freq kvjhvb (8) - 1 freq tavok (8) - 1 freq tvj (8) - 2 freq hjtkb (8) - 1 freq xojkb (8) - 1 freq jsjz (8) - 1 freq jvjfoem (9) - 1 freq tasvrb (9) - 1 freq jojoba (9) - 1 freq jjeezo (9) - 1 freq |
SoundEx code - T212 teacups - 9 freq tacky-back - 1 freq taycups - 2 freq taecups - 1 freq tae-cups - 1 freq thickbiggeen - 1 freq take-offs - 1 freq tuk-bak - 1 freq tcqpxgh - 1 freq txfhjjhir - 1 freq tjvjzkb - 1 freq thecovecrooner - 1 freq tgbkipcstv - 1 freq thecpeacock - 1 freq thesps - 1 freq tojvkat - 1 freq |
MetaPhone code - TJFJSKB tjvjzkb - 1 freq |
TJVJZKB |
| Time to execute Levenshtein function - 0.246832 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.413510 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.030217 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.042635 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.000863 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. |