| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hairsbreadth (0) - 1 freq hairtbeat (4) - 5 freq hairtbrauk (5) - 1 freq arbroath (5) - 16 freq hairset (5) - 3 freq hairspray (5) - 4 freq breadth (5) - 11 freq hairsted (5) - 1 freq harpreach (5) - 3 freq hairbrush (5) - 3 freq miscreants (6) - 1 freq hairsters (6) - 4 freq hairstit (6) - 4 freq galbraith (6) - 2 freq hiraeth (6) - 1 freq hairst (6) - 182 freq hairted (6) - 2 freq hairstpark (6) - 1 freq warbeth (6) - 1 freq spreath (6) - 2 freq hundredth (6) - 2 freq harprest (6) - 1 freq cairtclaith (6) - 1 freq hirseled (6) - 1 freq hairster (6) - 1 freq |
hairsbreadth (0) - 1 freq hairtbeat (8) - 5 freq breadth (8) - 11 freq hairbrush (8) - 3 freq arbroath (8) - 16 freq horseradish (8) - 3 freq horsbroch (8) - 10 freq horsburgh (9) - 2 freq hundredth (9) - 2 freq breidth (9) - 4 freq hairspray (9) - 4 freq hairsted (9) - 1 freq harpreach (9) - 3 freq hairset (9) - 3 freq hairtbrauk (9) - 1 freq sair-braithed (10) - 1 freq heartbeat (10) - 2 freq €œbreath (10) - 1 freq braidth (10) - 10 freq hairth (10) - 26 freq herdeth (10) - 1 freq harprect (10) - 1 freq hairsts (10) - 7 freq hairriet (10) - 2 freq hairtbroken (10) - 3 freq |
SoundEx code - H621 heirship - 6 freq horseflesh - 1 freq horseback - 11 freq heirschip - 1 freq heirskip - 185 freq here'safew - 1 freq horoscope - 1 freq hairspray - 4 freq horoscopes - 1 freq horsbroch - 10 freq horse-box - 1 freq hairsbreadth - 1 freq horoscope's - 1 freq heirskeip - 96 freq heirskeips - 1 freq horsburgh - 2 freq horseflee - 1 freq horsefaal - 11 freq horsefadl - 1 freq horseplay - 1 freq horssbressis - 1 freq heirschippis - 1 freq herskip - 1 freq hersef - 1 freq harrygowbakery - 2 freq |
MetaPhone code - HRSBRT0 hairsbreadth - 1 freq |
HAIRSBREADTH |
| Time to execute Levenshtein function - 0.413274 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.620462 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.034877 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.054609 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.001173 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. |