| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auldtime (0) - 2 freq auldrife (2) - 1 freq oul-time (2) - 2 freq ful-time (2) - 2 freq auldwife (2) - 1 freq airtime (3) - 1 freq oul-tyme (3) - 1 freq auldhill (3) - 26 freq auldies (3) - 1 freq bedtime (3) - 17 freq ae-time (3) - 5 freq bltime (3) - 1 freq yuletide (3) - 12 freq aulde (3) - 1 freq auldish (3) - 1 freq full-time (3) - 3 freq auldyin (3) - 1 freq sumtime (3) - 3 freq flytime (3) - 2 freq bauldwife (3) - 1 freq auldgit (3) - 1 freq hail-time (3) - 1 freq ultima (3) - 4 freq cauldrife (3) - 9 freq auldyins (3) - 1 freq |
auldtime (0) - 2 freq oul-time (3) - 2 freq auldrife (4) - 1 freq ultima (4) - 4 freq oul-tyme (4) - 1 freq bedtime (4) - 17 freq auldwife (4) - 1 freq ful-time (4) - 2 freq fultyme (5) - 1 freq auldyins (5) - 1 freq hail-time (5) - 1 freq ane-time (5) - 1 freq aftime (5) - 4 freq old-timey (5) - 1 freq auldgit (5) - 1 freq aw-time (5) - 1 freq daytime (5) - 7 freq anytime (5) - 29 freq lifetime (5) - 52 freq yuletide (5) - 12 freq aulde (5) - 1 freq bltime (5) - 1 freq airtime (5) - 1 freq ae-time (5) - 5 freq auldish (5) - 1 freq |
SoundEx code - A435 aulden - 15 freq auldtime - 2 freq allotment - 6 freq auldyins - 1 freq auldyin - 1 freq auld-yin - 1 freq auld-mither - 1 freq aladdin's - 2 freq aaldness - 1 freq auld-maid - 1 freq auld-young - 2 freq auld-angles - 3 freq aald-mither - 1 freq aladdin - 1 freq €˜auld-angles - 1 freq auldmoaninggit - 1 freq allotments - 1 freq aladdinsane - 2 freq aldmyqxyyz - 1 freq |
MetaPhone code - ALTTM auldtime - 2 freq |
AULDTIME |
| Time to execute Levenshtein function - 0.234462 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.429114 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.032152 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.039538 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.000922 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. |