| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| balmoral (0) - 11 freq balmorals (1) - 1 freq amoral (2) - 1 freq falderal (3) - 1 freq 'ammiral (3) - 3 freq 'moral (3) - 1 freq floral (3) - 3 freq gomoral (3) - 1 freq admiral (3) - 3 freq ballarat (3) - 1 freq almerals (3) - 1 freq balboa (3) - 1 freq pastoral (3) - 6 freq moral (3) - 88 freq mayoral (3) - 1 freq balamory (3) - 1 freq balmour (3) - 1 freq balcormo (3) - 1 freq immoral (3) - 5 freq balmer (3) - 2 freq bylocal (3) - 1 freq balmy (4) - 2 freq memorial (4) - 37 freq national (4) - 375 freq morals (4) - 10 freq |
balmoral (0) - 11 freq balmorals (2) - 1 freq balamory (4) - 1 freq amoral (4) - 1 freq balmer (4) - 2 freq balmour (4) - 1 freq mayoral (5) - 1 freq balcormo (5) - 1 freq bylocal (5) - 1 freq balmurdie (5) - 1 freq moral (5) - 88 freq immoral (5) - 5 freq balmerino (5) - 1 freq 'moral (5) - 1 freq falderal (5) - 1 freq 'ammiral (5) - 3 freq gomoral (5) - 1 freq floral (5) - 3 freq almerals (5) - 1 freq admiral (5) - 3 freq ballarat (5) - 1 freq numeral (6) - 5 freq balmedie (6) - 7 freq balfour (6) - 50 freq culural (6) - 1 freq |
SoundEx code - B456 balmoral - 11 freq bloomers - 5 freq balamory - 1 freq blunner - 1 freq balmurdie - 1 freq balmorals - 1 freq balmour - 1 freq balmer - 2 freq balmerino - 1 freq |
MetaPhone code - BLMRL balmoral - 11 freq |
BALMORAL |
| Time to execute Levenshtein function - 0.186605 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.337945 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.027418 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.037294 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.000871 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. |