| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bribing (0) - 1 freq brining (1) - 1 freq bribin (1) - 1 freq bryning (2) - 1 freq beijing (2) - 1 freq riding (2) - 12 freq pricing (2) - 1 freq biting (2) - 1 freq driving (2) - 19 freq bombing (2) - 2 freq writing (2) - 95 freq boiling (2) - 2 freq bringing (2) - 16 freq bring (2) - 554 freq rising (2) - 14 freq biking (2) - 2 freq biding (2) - 9 freq bruising (2) - 1 freq briefing (2) - 3 freq breing (2) - 1 freq brimming (2) - 2 freq pricin (3) - 2 freq gaining (3) - 2 freq beikin (3) - 3 freq beirins (3) - 1 freq |
bribing (0) - 1 freq brining (2) - 1 freq bribin (2) - 1 freq bruising (3) - 1 freq breing (3) - 1 freq bring (3) - 554 freq bryning (3) - 1 freq bombing (3) - 2 freq briefing (3) - 3 freq burying (4) - 1 freq breeding (4) - 1 freq burping (4) - 1 freq brung (4) - 21 freq breading (4) - 1 freq barking (4) - 1 freq brbzg (4) - 1 freq breinge (4) - 7 freq boring (4) - 14 freq breeng (4) - 3 freq breezing (4) - 1 freq breaking (4) - 12 freq burning (4) - 13 freq birring (4) - 1 freq brang (4) - 2 freq bearing (4) - 6 freq |
SoundEx code - B615 briefin - 2 freq bourbon - 2 freq bribin - 1 freq bereavement - 4 freq bribing - 1 freq bravin - 3 freq burpin - 1 freq barfin - 1 freq bare-banes - 1 freq burping - 1 freq briefness - 1 freq bravehound - 4 freq briefing - 3 freq bravenewworld - 3 freq briefings - 1 freq |
MetaPhone code - BRBNK bribing - 1 freq |
BRIBING |
| Time to execute Levenshtein function - 0.292495 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.539555 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.058086 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.037494 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.000897 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. |