| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iolite (0) - 1 freq olite (1) - 3 freq polite (1) - 53 freq police (2) - 77 freq ility (2) - 1 freq polity (2) - 4 freq nolte (2) - 1 freq sklite (2) - 1 freq slite (2) - 4 freq incite (2) - 1 freq isolate (2) - 8 freq inite (2) - 6 freq solit (2) - 5 freq tonite (2) - 6 freq ilive (2) - 1 freq ilie (2) - 1 freq holit (2) - 1 freq olive (2) - 15 freq ignite (2) - 4 freq olate (2) - 1 freq holie (2) - 10 freq lite (2) - 3 freq illie (2) - 2 freq kopite (2) - 2 freq delite (2) - 4 freq |
iolite (0) - 1 freq olite (1) - 3 freq elite (2) - 21 freq oolit (2) - 2 freq lite (2) - 3 freq olate (2) - 1 freq polite (2) - 53 freq ility (2) - 1 freq delite (3) - 4 freq illie (3) - 2 freq flite (3) - 2 freq oleit (3) - 1 freq lyte (3) - 1 freq lit (3) - 261 freq oolt (3) - 1 freq lote (3) - 1 freq late (3) - 491 freq politie (3) - 2 freq yolt (3) - 1 freq isolate (3) - 8 freq slite (3) - 4 freq olive (3) - 15 freq polity (3) - 4 freq nolte (3) - 1 freq inite (3) - 6 freq |
SoundEx code - I430 iliad - 3 freq iolite - 1 freq ility - 1 freq iled - 1 freq ildtdai - 1 freq |
MetaPhone code - ILT iliad - 3 freq iolite - 1 freq ility - 1 freq iled - 1 freq |
IOLITE |
| Time to execute Levenshtein function - 0.202888 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.362475 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.033930 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.040482 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.000788 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. |