| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banefed (0) - 2 freq banjoed (2) - 1 freq briefed (2) - 2 freq bantered (2) - 1 freq banned (2) - 35 freq banged (2) - 26 freq baneyerd (2) - 1 freq bandied (2) - 1 freq baesed (2) - 1 freq banked (2) - 2 freq boned (3) - 2 freq bank-e (3) - 1 freq fankled (3) - 14 freq barked (3) - 9 freq baffled (3) - 4 freq bunged (3) - 7 freq rankled (3) - 1 freq blanked (3) - 3 freq 'need (3) - 2 freq 'enewed (3) - 1 freq haeted (3) - 1 freq ansed (3) - 1 freq naemed (3) - 1 freq bachled (3) - 1 freq wakened (3) - 9 freq |
banefed (0) - 2 freq baneyerd (3) - 1 freq bandied (3) - 1 freq banged (3) - 26 freq banked (3) - 2 freq briefed (3) - 2 freq banned (3) - 35 freq banjoed (3) - 1 freq bouffed (4) - 4 freq bonxied (4) - 1 freq knifed (4) - 1 freq banefire (4) - 3 freq biffed (4) - 1 freq bonded (4) - 3 freq band (4) - 181 freq banffie (4) - 2 freq bannid (4) - 1 freq binged (4) - 1 freq banff (4) - 45 freq binned (4) - 1 freq banoffee (4) - 1 freq buffed (4) - 1 freq banf (4) - 1 freq boned (4) - 2 freq baesed (4) - 1 freq |
SoundEx code - B513 bumped - 23 freq bombed - 7 freq benefit - 73 freq bampots'll - 1 freq bampot - 30 freq benifit - 1 freq benefit-of - 1 freq benifits - 1 freq benefits - 55 freq bampot's - 1 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq bampôtisserie - 1 freq benefitit - 1 freq benefeits - 1 freq bampots - 8 freq banefed - 2 freq benefittit - 2 freq benefited - 2 freq 'bampots' - 1 freq benefitin - 2 freq benifitit - 1 freq benefitted - 1 freq |
MetaPhone code - BNFT benefit - 73 freq benifit - 1 freq banefed - 2 freq |
BANEFED |
| Time to execute Levenshtein function - 0.182080 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.374914 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.029123 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.039259 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.000948 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. |