| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| braeface (0) - 3 freq brae-face (1) - 6 freq preface (2) - 2 freq brakefast (3) - 6 freq braeside (3) - 11 freq benefice (3) - 1 freq ramrace (3) - 1 freq brieflie (3) - 1 freq baa-faced (3) - 1 freq truefact (3) - 1 freq braethe (3) - 6 freq blae-faced (3) - 2 freq brattach (3) - 3 freq artefact (3) - 3 freq brace (3) - 30 freq briefcase (3) - 12 freq braefoot (3) - 1 freq braemar (3) - 27 freq ruefae (3) - 2 freq befare (3) - 2 freq brakfast (3) - 33 freq breach (3) - 11 freq breac (3) - 5 freq gracefae (3) - 1 freq bookface (3) - 1 freq |
braeface (0) - 3 freq brae-face (2) - 6 freq preface (3) - 2 freq braefoot (4) - 1 freq briefcase (4) - 12 freq bookface (4) - 1 freq brace (4) - 30 freq breac (4) - 5 freq barefaced (4) - 2 freq brieflie (4) - 1 freq benefice (4) - 1 freq bruce (5) - 352 freq bryce (5) - 5 freq bretane (5) - 4 freq braeside (5) - 11 freq preface' (5) - 1 freq briefly (5) - 19 freq surface (5) - 86 freq brief (5) - 38 freq brice (5) - 2 freq truefact (5) - 1 freq briefed (5) - 2 freq briefin (5) - 2 freq braethe (5) - 6 freq bref (5) - 1 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 |
BRAEFACE |
| Time to execute Levenshtein function - 0.493458 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.922367 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.099618 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.169494 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.001285 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. |