| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banff (0) - 45 freq banf (1) - 1 freq baff (1) - 3 freq bluff (2) - 4 freq funff (2) - 1 freq bandy (2) - 13 freq baef (2) - 6 freq bane- (2) - 1 freq balf (2) - 1 freq aff (2) - 4400 freq banffie (2) - 2 freq banjo (2) - 17 freq naff (2) - 2 freq bane (2) - 81 freq bangu (2) - 1 freq ban'k (2) - 1 freq bans (2) - 35 freq baf (2) - 1 freq bantu (2) - 1 freq bann (2) - 9 freq bumff (2) - 1 freq banes (2) - 205 freq waff (2) - 19 freq bouff (2) - 1 freq gaff (2) - 34 freq |
banff (0) - 45 freq baff (2) - 3 freq banffie (2) - 2 freq banf (2) - 1 freq bowff (3) - 1 freq naff (3) - 2 freq anoff (3) - 6 freq baffe (3) - 2 freq bumff (3) - 1 freq bluff (3) - 4 freq bouff (3) - 1 freq anuff (3) - 28 freq buff (3) - 15 freq bff (3) - 1 freq funff (3) - 1 freq banoffee (3) - 1 freq blaff (3) - 2 freq baffy (3) - 3 freq bang (4) - 100 freq bauf (4) - 1 freq banie (4) - 1 freq haff (4) - 4 freq banis (4) - 1 freq anof (4) - 4 freq bands (4) - 41 freq |
SoundEx code - B510 bumbee - 4 freq bamboo - 9 freq bumph - 3 freq bump - 23 freq bonnify - 2 freq bomb - 31 freq 'bmv - 1 freq bombay - 5 freq bnb - 1 freq banff - 45 freq b'nb - 2 freq benbuie - 2 freq bombe - 1 freq bumpy - 1 freq bambi - 1 freq banffie - 2 freq bnp - 1 freq banoffee - 1 freq bvnwupi - 1 freq banf - 1 freq bumff - 1 freq bimbo - 1 freq |
MetaPhone code - BNF bonnify - 2 freq banff - 45 freq banffie - 2 freq banoffee - 1 freq banf - 1 freq |
BANFF |
| Time to execute Levenshtein function - 0.212321 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.393978 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.027447 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.036984 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.000910 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. |