| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ouldir (0) - 1 freq oldie (2) - 2 freq buddir (2) - 3 freq ouler (2) - 8 freq oardir (2) - 1 freq yundir (2) - 2 freq owlder (2) - 14 freq boulder (2) - 9 freq mulder (2) - 1 freq bulder (2) - 4 freq oulii (2) - 1 freq mouldit (2) - 1 freq outhir (2) - 1 freq aulder (2) - 245 freq older (2) - 27 freq gulder (2) - 24 freq ould (2) - 21 freq oarder (3) - 5 freq felder (3) - 1 freq fauldit (3) - 16 freq coulda (3) - 32 freq jundie (3) - 3 freq iulii (3) - 1 freq couldno (3) - 5 freq boolder (3) - 1 freq |
ouldir (0) - 1 freq older (2) - 27 freq aulder (2) - 245 freq gulder (3) - 24 freq ouler (3) - 8 freq ould (3) - 21 freq oldie (3) - 2 freq aalder (3) - 24 freq alder (3) - 1 freq elder (3) - 58 freq louder (3) - 40 freq owlder (3) - 14 freq oardir (3) - 1 freq yundir (3) - 2 freq boulder (3) - 9 freq mulder (3) - 1 freq bulder (3) - 4 freq eilder (3) - 1 freq eddir (4) - 10 freq iddir (4) - 11 freq auler (4) - 17 freq dolder (4) - 1 freq baulder (4) - 2 freq lauder (4) - 6 freq oldies (4) - 1 freq |
SoundEx code - O436 older - 27 freq olderfleet - 1 freq older-twin - 1 freq oil-drum - 1 freq owlder - 14 freq €˜older - 1 freq ouldir - 1 freq oltrvx - 1 freq oldrovers - 1 freq |
MetaPhone code - OLTR older - 27 freq owlder - 14 freq €˜older - 1 freq ouldir - 1 freq |
OULDIR |
| Time to execute Levenshtein function - 0.216129 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.340885 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.028959 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.037644 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.000874 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. |