| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| balmour (0) - 1 freq balfour (1) - 50 freq lamour (2) - 1 freq balmer (2) - 2 freq valour (2) - 1 freq gilmour (2) - 4 freq armour (2) - 10 freq amour (2) - 1 freq famour (2) - 1 freq barbour (2) - 17 freq ballo (3) - 1 freq saltoun (3) - 3 freq balm (3) - 6 freq balms (3) - 1 freq faumous (3) - 3 freq rancour (3) - 2 freq balgove (3) - 1 freq bayou (3) - 1 freq balfour's (3) - 1 freq harbour (3) - 49 freq fallout (3) - 1 freq allous (3) - 27 freq blout (3) - 1 freq armoury (3) - 2 freq allout (3) - 2 freq |
balmour (0) - 1 freq balmer (2) - 2 freq balfour (2) - 50 freq balamory (3) - 1 freq gilmour (3) - 4 freq lamour (3) - 1 freq palmer (4) - 3 freq balr (4) - 1 freq calmer (4) - 3 freq bloum (4) - 1 freq glamour (4) - 29 freq clamour (4) - 8 freq balmy (4) - 2 freq beglamour (4) - 3 freq balmoral (4) - 11 freq blur (4) - 14 freq balder (4) - 1 freq belabour (4) - 1 freq baler (4) - 4 freq armour (4) - 10 freq amour (4) - 1 freq barbour (4) - 17 freq balm (4) - 6 freq valour (4) - 1 freq balms (4) - 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 - BLMR balamory - 1 freq balmour - 1 freq balmer - 2 freq |
BALMOUR |
| Time to execute Levenshtein function - 0.410183 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.779599 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.088135 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.097677 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.000940 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. |