Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
-year-aul (0) - 1 freq -year-auld (1) - 3 freq year-auld (2) - 7 freq year-aulds (3) - 2 freq yeir-oul (3) - 2 freq -year-old (3) - 1 freq -year-auld's (3) - 1 freq nearhaun (4) - 69 freq near-haun (4) - 5 freq year-en (4) - 1 freq clear-up (4) - 1 freq -year (4) - 1 freq clear-cut (4) - 1 freq jean-paul (4) - 5 freq ten-year-auld (4) - 4 freq earful (4) - 2 freq yersail (4) - 1 freq fearful (4) - 10 freq yearbeuk (4) - 1 freq yeit-oul (4) - 1 freq yae-aal (4) - 1 freq tearful (4) - 2 freq twaa-year-aul (4) - 2 freq year-lang (4) - 3 freq yardarm (5) - 1 freq |
-year-aul (0) - 1 freq -year-auld (2) - 3 freq yeir-oul (4) - 2 freq -year-old (4) - 1 freq year-auld (4) - 7 freq fearful (6) - 10 freq yersail (6) - 1 freq yeit-oul (6) - 1 freq yae-aal (6) - 1 freq bar-l (6) - 1 freq tearful (6) - 2 freq twaa-year-aul (6) - 2 freq earful (6) - 2 freq -year-auld's (6) - 1 freq year-en (6) - 1 freq year-aulds (6) - 2 freq -year (6) - 1 freq derval (7) - 17 freq yirsael (7) - 2 freq cereal (7) - 15 freq near-on (7) - 2 freq aerial (7) - 5 freq pearl (7) - 8 freq yea-r (7) - 1 freq bearable (7) - 5 freq |
SoundEx code - Y640 yeir-oul - 2 freq yearly - 10 freq yeirly - 2 freq yarl - 18 freq yerl - 1 freq yeirlie - 1 freq -year-aul - 1 freq yoorwullie - 5 freq |
MetaPhone code - YRL yeir-oul - 2 freq yearly - 10 freq yeirly - 2 freq yarl - 18 freq yerl - 1 freq yeirlie - 1 freq -year-aul - 1 freq |
-YEAR-AUL |
Time to execute Levenshtein function - 0.795649 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.208858 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.096699 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.098186 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.001664 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. |