| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| braves (0) - 3 freq braver (1) - 4 freq craves (1) - 2 freq brave (1) - 134 freq braved (1) - 1 freq brave' (1) - 1 freq braces (1) - 12 freq bravest (1) - 5 freq braes (1) - 114 freq graves (1) - 31 freq brakes (1) - 17 freq raves (1) - 5 freq braen (2) - 1 freq groves (2) - 2 freq cranes (2) - 7 freq greves (2) - 1 freq braiss (2) - 3 freq graver (2) - 1 freq grades (2) - 10 freq brae' (2) - 1 freq rapes (2) - 1 freq brace' (2) - 1 freq babes (2) - 6 freq bravi (2) - 1 freq raes (2) - 2 freq |
braves (0) - 3 freq bravest (2) - 5 freq braes (2) - 114 freq brakes (2) - 17 freq braces (2) - 12 freq graves (2) - 31 freq raves (2) - 5 freq braver (2) - 4 freq brave' (2) - 1 freq craves (2) - 2 freq brave (2) - 134 freq braved (2) - 1 freq drives (3) - 27 freq proves (3) - 14 freq droves (3) - 10 freq braks (3) - 18 freq pruves (3) - 1 freq bruces (3) - 13 freq behaves (3) - 3 freq bradies (3) - 2 freq bravely (3) - 8 freq brides (3) - 3 freq bravery (3) - 6 freq braws (3) - 14 freq brags (3) - 4 freq |
SoundEx code - B612 bare-faced - 4 freq barefaced - 2 freq bravest - 5 freq brae-face - 6 freq braeface - 3 freq barra-boys - 1 freq barbecue - 8 freq brawbuskit - 1 freq barbican - 1 freq briefcase - 12 freq briefs - 2 freq barbs - 1 freq bribes - 2 freq barbecues - 1 freq barabbas - 4 freq barbecued - 1 freq braves - 3 freq barbies - 3 freq barbeeeq - 1 freq brbzg - 1 freq barrabest - 2 freq briefcaseni - 1 freq barrowafc - 1 freq |
MetaPhone code - BRFS brae-face - 6 freq braeface - 3 freq briefs - 2 freq braves - 3 freq |
BRAVES |
| Time to execute Levenshtein function - 0.237606 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.447085 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.029247 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.039468 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.000907 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. |