| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aulds (0) - 3 freq caulds (1) - 1 freq auld's (1) - 3 freq faulds (1) - 20 freq haulds (1) - 2 freq auld (1) - 3449 freq auld' (1) - 1 freq aulde (1) - 1 freq kurds (2) - 1 freq gauls (2) - 2 freq sauld (2) - 1 freq cauld's (2) - 3 freq suld (2) - 11 freq moulds (2) - 2 freq aunts (2) - 10 freq hauld (2) - 11 freq ales (2) - 1 freq ails (2) - 9 freq hulks (2) - 4 freq mulls (2) - 6 freq aul (2) - 395 freq duds (2) - 15 freq guids (2) - 24 freq arles (2) - 5 freq aul' (2) - 5 freq |
aulds (0) - 3 freq olds (2) - 3 freq eilds (2) - 2 freq auldies (2) - 1 freq lauds (2) - 1 freq auld' (2) - 1 freq aulde (2) - 1 freq auld's (2) - 3 freq auld (2) - 3449 freq faulds (2) - 20 freq caulds (2) - 1 freq haulds (2) - 2 freq als (3) - 27 freq ulls (3) - 1 freq aild (3) - 1 freq alps (3) - 2 freq houlds (3) - 1 freq mlds (3) - 1 freq allus (3) - 4 freq leeds (3) - 9 freq guds (3) - 1 freq dauds (3) - 26 freq yauld (3) - 2 freq loads (3) - 84 freq acids (3) - 1 freq |
SoundEx code - A432 although - 157 freq auldest - 46 freq altogether - 6 freq auld's - 3 freq auldhouseburn - 3 freq aldo's - 29 freq auld-sons - 1 freq althegither - 2 freq althegether - 1 freq aaldest - 8 freq aldi's - 2 freq altocumulus - 1 freq auldsters - 2 freq aaldist - 1 freq €”although - 1 freq aulds - 3 freq aaltaegethir - 1 freq aldest - 1 freq aldiuk - 3 freq auldgit - 1 freq auldsideheid - 1 freq aaltaegither - 1 freq auldies - 1 freq |
MetaPhone code - ALTS auld's - 3 freq aldo's - 29 freq aldi's - 2 freq aulds - 3 freq auldies - 1 freq |
AULDS |
| Time to execute Levenshtein function - 0.789500 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 - 1.005896 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.086696 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.101264 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.000847 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. |