| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xjle (0) - 1 freq xje (1) - 1 freq isle (2) - 85 freq sale (2) - 63 freq vole (2) - 1 freq tyle (2) - 1 freq yale (2) - 7 freq jxe (2) - 1 freq yule (2) - 79 freq lile (2) - 1 freq pyle (2) - 2 freq qjte (2) - 1 freq xji (2) - 1 freq rule (2) - 164 freq wjlb (2) - 1 freq rile (2) - 3 freq xjad (2) - 1 freq male (2) - 59 freq ile (2) - 65 freq aale (2) - 1 freq xlz (2) - 1 freq je (2) - 10 freq yle (2) - 2 freq kyle (2) - 80 freq xwe (2) - 1 freq |
xjle (0) - 1 freq xje (2) - 1 freq njl (3) - 1 freq xjad (3) - 1 freq jile (3) - 42 freq xju (3) - 1 freq xsl (3) - 1 freq xol (3) - 1 freq jl (3) - 4 freq exile (3) - 20 freq jyle (3) - 47 freq axle (3) - 1 freq xji (3) - 1 freq xjb (3) - 1 freq xtl (3) - 1 freq xja (3) - 1 freq xl (3) - 3 freq ojly (3) - 1 freq xulc (4) - 1 freq idle (4) - 27 freq cule (4) - 1 freq wyle (4) - 5 freq zje (4) - 1 freq fyle (4) - 117 freq able (4) - 436 freq |
SoundEx code - X400 xl - 3 freq xjle - 1 freq xsl - 1 freq xczl - 1 freq xgayl - 2 freq xol - 1 freq |
MetaPhone code - SJL sgeul - 1 freq sagely - 2 freq xjle - 1 freq |
XJLE |
| Time to execute Levenshtein function - 0.365568 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.793584 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.027277 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.088684 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.001095 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. |