| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| briefin (0) - 2 freq briefing (1) - 3 freq britain (2) - 108 freq breezin (2) - 1 freq grievin (2) - 14 freq breedin (2) - 9 freq triefen (2) - 1 freq briefings (2) - 1 freq brewin (2) - 8 freq briggin (2) - 4 freq briefly (2) - 19 freq bribin (2) - 1 freq brickin (2) - 2 freq brief (2) - 38 freq criein (2) - 1 freq bringin (2) - 115 freq briefs (2) - 2 freq brimmin (2) - 13 freq tiefin (2) - 3 freq breemin (2) - 1 freq briefed (2) - 2 freq brieflie (2) - 1 freq brekin (2) - 7 freq breetin (2) - 1 freq brixton (3) - 1 freq |
briefin (0) - 2 freq briefing (2) - 3 freq breemin (3) - 1 freq briefs (3) - 2 freq bribin (3) - 1 freq briefed (3) - 2 freq brekin (3) - 7 freq breetin (3) - 1 freq briefly (3) - 19 freq brieflie (3) - 1 freq brief (3) - 38 freq brewin (3) - 8 freq barfin (3) - 1 freq breedin (3) - 9 freq triefen (3) - 1 freq breezin (3) - 1 freq britain (3) - 108 freq roofin (4) - 1 freq briton (4) - 1 freq bruisin (4) - 6 freq birsin (4) - 4 freq baffin (4) - 1 freq breakin (4) - 21 freq breadin (4) - 1 freq brenn (4) - 2 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 - BRFN briefin - 2 freq broughan - 1 freq bravin - 3 freq barfin - 1 freq |
BRIEFIN |
| Time to execute Levenshtein function - 0.385533 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.645189 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.064572 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.038101 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.000923 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. |