| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| flame-haired (0) - 1 freq blak-haired (3) - 1 freq fair-haired (3) - 1 freq daark-haired (4) - 1 freq glar-laired (4) - 1 freq wire-haired (4) - 1 freq whyte-haired (4) - 1 freq langhaired (4) - 1 freq white-haired (4) - 1 freq lang-hained (4) - 1 freq grave-yaird (5) - 2 freq stane-haurd (5) - 1 freq flat-sided (5) - 1 freq shame-faced (5) - 2 freq re-haimed (5) - 1 freq blae-faced (5) - 2 freq flaachtered (5) - 3 freq curly-haired (5) - 1 freq lang-hairit (5) - 1 freq flachtered (5) - 1 freq flat-packed (5) - 1 freq short-haired (5) - 1 freq stane-tired (5) - 2 freq flauchtered (5) - 4 freq hame-airt (5) - 1 freq |
flame-haired (0) - 1 freq fair-haired (5) - 1 freq blak-haired (5) - 1 freq langhaired (7) - 1 freq whyte-haired (7) - 1 freq white-haired (7) - 1 freq wire-haired (7) - 1 freq glar-laired (7) - 1 freq daark-haired (7) - 1 freq dee-haird (8) - 1 freq daurk-haired (8) - 2 freq flauchtered (8) - 4 freq derk-haired (8) - 1 freq flaired (8) - 2 freq flachtered (8) - 1 freq flair-burd (8) - 1 freq half-hairted (8) - 1 freq rid-haired (8) - 1 freq half-hard (8) - 2 freq flaachtered (8) - 3 freq flat-sided (8) - 1 freq stane-haurd (8) - 1 freq curly-haired (8) - 1 freq lang-hained (8) - 1 freq flooered (9) - 1 freq |
SoundEx code - F456 flamer - 1 freq flinrichen - 1 freq flame-haired - 1 freq flimmer - 2 freq fulmars - 2 freq fellow-mortal - 1 freq feelin-herted - 1 freq fulmart - 1 freq fulmartis - 1 freq flamarrion - 1 freq feliamort - 1 freq fulmar - 2 freq |
MetaPhone code - FLMHRT flame-haired - 1 freq |
FLAME-HAIRED |
| Time to execute Levenshtein function - 0.239879 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.398019 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.029183 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.039548 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.000924 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. |