| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brave (0) - 134 freq 'brave (1) - 1 freq rave (1) - 10 freq bravi (1) - 1 freq brace (1) - 30 freq brae (1) - 285 freq drave (1) - 61 freq brava (1) - 1 freq brave' (1) - 1 freq braves (1) - 3 freq brade (1) - 1 freq brake (1) - 14 freq crave (1) - 13 freq brahe (1) - 1 freq grave (1) - 130 freq braver (1) - 4 freq braved (1) - 1 freq drove (2) - 68 freq braar (2) - 1 freq skave (2) - 4 freq beame (2) - 1 freq abrade (2) - 1 freq €œave (2) - 2 freq braced (2) - 1 freq gravy (2) - 28 freq |
brave (0) - 134 freq brava (1) - 1 freq bravi (1) - 1 freq crave (2) - 13 freq grave (2) - 130 freq braver (2) - 4 freq braved (2) - 1 freq brev (2) - 31 freq brake (2) - 14 freq bruv (2) - 2 freq brahe (2) - 1 freq brade (2) - 1 freq brace (2) - 30 freq rave (2) - 10 freq drave (2) - 61 freq brae (2) - 285 freq braves (2) - 3 freq 'brave (2) - 1 freq brave' (2) - 1 freq braik (3) - 6 freq brine (3) - 8 freq brat (3) - 15 freq bravely (3) - 8 freq bravery (3) - 6 freq drive (3) - 170 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 - BRF brave - 134 freq barrafu - 2 freq 'brave - 1 freq brough - 5 freq brief - 38 freq bravi - 1 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 |
BRAVE |
| Time to execute Levenshtein function - 0.195840 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.355414 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.027292 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.037455 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.000942 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. |