| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brief (0) - 37 freq briefs (1) - 2 freq brier (1) - 5 freq bried (1) - 10 freq grief (1) - 108 freq bref (1) - 1 freq brie (1) - 3 freq brio (2) - 1 freq crier (2) - 2 freq brel (2) - 2 freq brice (2) - 2 freq briny (2) - 1 freq brith (2) - 4 freq bri (2) - 2 freq cried (2) - 979 freq raef (2) - 2 freq beif (2) - 2 freq driet (2) - 2 freq briefin (2) - 2 freq brek (2) - 131 freq bie (2) - 15 freq eries (2) - 1 freq brizz (2) - 3 freq €˜brief (2) - 1 freq tief (2) - 3 freq |
brief (0) - 37 freq bref (1) - 1 freq briefs (2) - 2 freq brier (2) - 5 freq brie (2) - 3 freq bried (2) - 10 freq grief (2) - 108 freq bride (3) - 55 freq briar (3) - 1 freq bren (3) - 2 freq biried (3) - 3 freq bree (3) - 58 freq brig (3) - 264 freq burie (3) - 4 freq bret (3) - 3 freq braes (3) - 113 freq dreef (3) - 4 freq buried (3) - 47 freq brij (3) - 3 freq barf (3) - 7 freq breez (3) - 1 freq preef (3) - 4 freq brise (3) - 1 freq bier (3) - 4 freq bidef (3) - 1 freq |
SoundEx code - B610 brave - 134 freq bribe - 3 freq barrafu - 2 freq 'brave - 1 freq barbie - 3 freq brief - 37 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 - BRF brave - 134 freq barrafu - 2 freq 'brave - 1 freq brough - 5 freq brief - 37 freq barrowfu - 2 freq brev - 31 freq baarafu - 2 freq barf - 7 freq borrow-foo - 1 freq broughe - 1 freq burraview - 2 freq brave' - 1 freq €˜brief - 1 freq barrafae - 1 freq borough - 1 freq bruv - 2 freq brava - 1 freq beragh - 2 freq bref - 1 freq |
BRIEF |
| Time to execute Levenshtein function - 0.328653 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.509079 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.059231 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.038053 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.000878 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. |