| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bribed (0) - 3 freq bribe (1) - 3 freq bried (1) - 10 freq bribes (1) - 2 freq brie (2) - 3 freq brimmed (2) - 4 freq brigend (2) - 1 freq briefed (2) - 2 freq brise (2) - 1 freq braced (2) - 1 freq bristed (2) - 3 freq scribed (2) - 1 freq bricked (2) - 2 freq bridged (2) - 1 freq biried (2) - 3 freq brizzed (2) - 1 freq baited (2) - 1 freq fried (2) - 33 freq bribery (2) - 6 freq boxbed (2) - 2 freq bombed (2) - 7 freq breed (2) - 58 freq biled (2) - 38 freq gried (2) - 8 freq bred (2) - 36 freq |
bribed (0) - 3 freq bairbed (2) - 1 freq barbed (2) - 4 freq bribes (2) - 2 freq bribe (2) - 3 freq bried (2) - 10 freq brigad (3) - 1 freq braiged (3) - 2 freq bribin (3) - 1 freq brewed (3) - 6 freq grabed (3) - 1 freq braided (3) - 2 freq buried (3) - 47 freq babbed (3) - 1 freq braed (3) - 5 freq bridei (3) - 1 freq bruised (3) - 16 freq braved (3) - 1 freq breed (3) - 58 freq bobbed (3) - 1 freq bred (3) - 36 freq braised (3) - 1 freq bombed (3) - 7 freq braced (3) - 1 freq briefed (3) - 2 freq |
SoundEx code - B613 bare-fitted - 1 freq barefit - 13 freq braivity - 3 freq barfit - 4 freq bereft - 13 freq barefuit - 10 freq bare-fittit - 1 freq bravado - 9 freq barbados - 6 freq barbadoes - 1 freq bare-fit - 5 freq barbt - 1 freq bribed - 3 freq barefoot - 3 freq burped - 2 freq bravitie - 1 freq barbed - 4 freq bairbed - 1 freq braivitie - 1 freq bereft- - 2 freq brobbed - 1 freq barbit-weer - 1 freq barbie-dalls - 1 freq bare-fuit - 1 freq barfittit - 1 freq braefoot - 1 freq bereaved - 2 freq briefed - 2 freq berry-fed - 1 freq braved - 1 freq birffday - 1 freq |
MetaPhone code - BRBT barbt - 1 freq bribed - 3 freq barbed - 4 freq bairbed - 1 freq brobbed - 1 freq |
BRIBED |
| Time to execute Levenshtein function - 0.213869 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.359701 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.029378 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.040904 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.000936 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. |