| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bribe (0) - 3 freq brie (1) - 3 freq brise (1) - 1 freq bribed (1) - 3 freq brice (1) - 2 freq bribes (1) - 2 freq tribe (1) - 26 freq bride (1) - 56 freq brine (1) - 8 freq brio (2) - 1 freq brim (2) - 17 freq brigs (2) - 19 freq trike (2) - 2 freq jibe (2) - 1 freq briar (2) - 1 freq prize (2) - 83 freq price (2) - 179 freq brief (2) - 38 freq crie (2) - 7 freq prile (2) - 3 freq brin (2) - 3 freq brigg (2) - 3 freq 'rise (2) - 3 freq bris (2) - 1 freq rive (2) - 18 freq |
bribe (0) - 3 freq tribe (2) - 26 freq bride (2) - 56 freq bribes (2) - 2 freq brine (2) - 8 freq brice (2) - 2 freq brise (2) - 1 freq brie (2) - 3 freq bribed (2) - 3 freq bridie (3) - 35 freq brude (3) - 3 freq bib (3) - 8 freq brig (3) - 266 freq crib (3) - 7 freq bree (3) - 58 freq bryce (3) - 5 freq bried (3) - 10 freq babe (3) - 11 freq bribery (3) - 6 freq rib (3) - 8 freq bruce (3) - 352 freq breme (3) - 1 freq briney (3) - 1 freq briny (3) - 1 freq barbie (3) - 3 freq |
SoundEx code - B610 brave - 134 freq bribe - 3 freq barrafu - 2 freq 'brave - 1 freq barbie - 3 freq brief - 38 freq bravi - 1 freq barrowfu - 2 freq brev - 31 freq baarafu - 2 freq broup - 1 freq burp - 9 freq barf - 7 freq borrow-foo - 1 freq burraview - 2 freq beryaev - 1 freq brave' - 1 freq €˜brief - 1 freq buuuurp - 1 freq barrafae - 1 freq bruv - 2 freq brava - 1 freq byrb - 1 freq byreboy - 1 freq bref - 1 freq |
MetaPhone code - BRB bribe - 3 freq barbie - 3 freq byrb - 1 freq byreboy - 1 freq |
BRIBE |
| Time to execute Levenshtein function - 0.340941 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.457295 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.031178 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.040685 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.001049 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. |