| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| briefcase (0) - 12 freq briefcaseni (2) - 1 freq braeface (3) - 3 freq briefness (3) - 1 freq brieflie (3) - 1 freq becase (3) - 15 freq briefs (3) - 2 freq brickle (4) - 1 freq crease (4) - 3 freq britstate (4) - 1 freq grease (4) - 12 freq briefly (4) - 18 freq briggade (4) - 1 freq brief (4) - 37 freq bookcase (4) - 2 freq brae-face (4) - 6 freq brecks (4) - 1 freq incase (4) - 11 freq suitcase (4) - 13 freq birdcage (4) - 3 freq brisbane (4) - 1 freq brigade (4) - 20 freq ruefae (4) - 2 freq briefed (4) - 2 freq brieists (4) - 1 freq |
briefcase (0) - 12 freq briefcaseni (3) - 1 freq briefs (4) - 2 freq braeface (4) - 3 freq briefness (5) - 1 freq becase (5) - 15 freq brieflie (5) - 1 freq becaase (6) - 6 freq refuise (6) - 1 freq brise (6) - 1 freq briefin (6) - 2 freq brice (6) - 2 freq becas (6) - 5 freq precise (6) - 14 freq becise (6) - 1 freq braidcast (6) - 21 freq bricks (6) - 24 freq briefings (6) - 1 freq preecise (6) - 1 freq befaas (6) - 2 freq refeese (6) - 1 freq because (6) - 695 freq refuse (6) - 24 freq bruces (6) - 13 freq barefaced (6) - 2 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 - 7 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 - BRFKS briefcase - 12 freq |
BRIEFCASE |
| Time to execute Levenshtein function - 0.460129 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.824249 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.078202 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.037992 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.000821 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. |