| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brcf (0) - 1 freq rcf (1) - 1 freq bref (1) - 1 freq brck (1) - 1 freq xrc (2) - 1 freq bruce (2) - 350 freq baf (2) - 1 freq bret (2) - 3 freq bca (2) - 1 freq beif (2) - 2 freq ref (2) - 36 freq bryz (2) - 1 freq brut (2) - 3 freq brr (2) - 5 freq bauf (2) - 1 freq brief (2) - 37 freq balf (2) - 1 freq bcp (2) - 1 freq bris (2) - 1 freq gcf (2) - 1 freq buff (2) - 15 freq bruk (2) - 3 freq brie (2) - 3 freq bowf (2) - 9 freq bace (2) - 1 freq |
brcf (0) - 1 freq brck (2) - 1 freq bref (2) - 1 freq rcf (2) - 1 freq bryce (3) - 5 freq brice (3) - 2 freq brace (3) - 30 freq barf (3) - 7 freq braco (3) - 7 freq brick (3) - 48 freq barca (3) - 1 freq brack (3) - 14 freq bruck (3) - 40 freq brock (3) - 73 freq breck (3) - 9 freq broch (3) - 86 freq brief (3) - 37 freq bruch (3) - 1 freq birch (3) - 2 freq bruce (3) - 350 freq rck (4) - 1 freq rdf (4) - 3 freq bkc (4) - 1 freq baff (4) - 3 freq rcs (4) - 2 freq |
SoundEx code - B621 breakfast - 138 freq bracky-bree - 4 freq bare-as-birkie - 1 freq brekfast - 13 freq brakfast - 33 freq brakfist - 4 freq braakfist - 13 freq breakfast's - 1 freq brek-up - 1 freq brekup - 1 freq brakfaist - 1 freq brigfoot - 3 freq braxfield - 3 freq breach-birth - 1 freq bric-a-brac - 2 freq bargepole - 2 freq bruckie-plate - 1 freq brakkfast - 5 freq breeze-blocks - 1 freq breakfist - 2 freq breakfasts - 4 freq breekbaund - 1 freq burrygaves - 3 freq 'burrygave' - 1 freq birk-branch - 1 freq brisbane - 1 freq brakkfast's - 1 freq brakkfaist - 2 freq brakkfest - 1 freq brakefast - 6 freq brockville - 1 freq brakfasts - 1 freq brake-fast - 1 freq brickbats - 2 freq €œbrakkfast - 1 freq breezeblock - 1 freq brak-up - 1 freq bar-keep - 1 freq brokebackybrae - 1 freq barackobama - 1 freq breakfa - 1 freq breakfastbirdwatch - 1 freq brcf - 1 freq broxburn - 5 freq broxburnathfc - 6 freq |
MetaPhone code - BRKF 'burrygave' - 1 freq breakfa - 1 freq brcf - 1 freq |
BRCF |
| Time to execute Levenshtein function - 0.187212 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.366596 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.027548 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.037339 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.000799 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. |