| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oilan (0) - 1 freq milan (1) - 3 freq toilan (1) - 1 freq soilan (1) - 1 freq oilcan (1) - 1 freq oilman (1) - 1 freq boilan (1) - 1 freq roilan (1) - 1 freq joinan (2) - 1 freq ian (2) - 202 freq gillan (2) - 5 freq kiln (2) - 7 freq dylan (2) - 15 freq gowlan (2) - 1 freq yican (2) - 1 freq toilin (2) - 2 freq uplan (2) - 4 freq smilan (2) - 8 freq bidan (2) - 9 freq solan (2) - 7 freq aigan (2) - 1 freq ritan (2) - 5 freq ridan (2) - 1 freq wilin (2) - 1 freq nila (2) - 1 freq |
oilan (0) - 1 freq lan (2) - 139 freq ilin (2) - 1 freq ailin (2) - 2 freq ulan (2) - 1 freq eilean (2) - 1 freq roilan (2) - 1 freq alan (2) - 150 freq oilcan (2) - 1 freq toilan (2) - 1 freq milan (2) - 3 freq oilman (2) - 1 freq soilan (2) - 1 freq boilan (2) - 1 freq feilan (3) - 2 freq livan (3) - 6 freq ola (3) - 1 freq oban (3) - 3 freq oilmen (3) - 1 freq ceilan (3) - 1 freq outlan (3) - 2 freq elon (3) - 1 freq flan (3) - 3 freq sailan (3) - 5 freq laun (3) - 76 freq |
SoundEx code - O450 oilan - 1 freq olina - 11 freq o'loon - 1 freq |
MetaPhone code - OLN oilan - 1 freq olina - 11 freq o'loon - 1 freq |
OILAN |
| Time to execute Levenshtein function - 0.317208 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.589310 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.028900 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.084441 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.001009 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. |