| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aboynefire (0) - 1 freq bonefire (2) - 1 freq bonfire (3) - 28 freq banefire (3) - 3 freq binfire (4) - 1 freq bonfires (4) - 8 freq boyndie (4) - 6 freq benefice (4) - 1 freq boygie (5) - 2 freq ayreshire (5) - 2 freq 'bonnie (5) - 2 freq joyner (5) - 1 freq beefie (5) - 1 freq bonxie (5) - 8 freq benefited (5) - 2 freq boys're (5) - 1 freq ayrshire (5) - 96 freq befaire (5) - 4 freq nefife (5) - 1 freq boannie (5) - 59 freq gunfire (5) - 3 freq boanie (5) - 2 freq abother (5) - 1 freq boykie (5) - 1 freq bonnielike (5) - 1 freq |
aboynefire (0) - 1 freq bonefire (2) - 1 freq banefire (3) - 3 freq bonfire (3) - 28 freq binfire (4) - 1 freq benefice (5) - 1 freq bonfires (5) - 8 freq before (6) - 560 freq befaire (6) - 4 freq openfire (6) - 1 freq benefit (6) - 74 freq bynear (6) - 2 freq gunfire (6) - 3 freq banffie (6) - 2 freq befare (6) - 2 freq boyndie (6) - 6 freq anymaire (7) - 11 freq boyne (7) - 4 freq surefire (7) - 1 freq bandeira (7) - 1 freq ebner (7) - 5 freq backfire (7) - 1 freq bonie (7) - 13 freq aboundit (7) - 1 freq snowfire (7) - 1 freq |
SoundEx code - A151 aboynefire - 1 freq |
MetaPhone code - ABNFR aboynefire - 1 freq |
ABOYNEFIRE |
| Time to execute Levenshtein function - 0.231775 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.382845 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.032109 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.039779 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.000848 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. |