| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fair-haired (0) - 1 freq rid-haired (3) - 1 freq fair-faced (3) - 3 freq daark-haired (3) - 1 freq wire-haired (3) - 1 freq flame-haired (3) - 1 freq daurk-haired (3) - 2 freq fair-sized (3) - 2 freq fairmyaird (3) - 4 freq fairfaced (4) - 1 freq langhaired (4) - 1 freq lang-hained (4) - 1 freq far-famed (4) - 1 freq fairbairn (4) - 7 freq white-haired (4) - 1 freq faur-skailed (4) - 1 freq fair-heidit (4) - 2 freq air-raid (4) - 1 freq short-haired (4) - 1 freq guid-hairted (4) - 1 freq glar-laired (4) - 1 freq farmyaird (4) - 1 freq airnhard (4) - 1 freq half-hairted (4) - 1 freq fair-shelled (4) - 1 freq |
fair-haired (0) - 1 freq wire-haired (4) - 1 freq daurk-haired (5) - 2 freq fairmyaird (5) - 4 freq flame-haired (5) - 1 freq fair-sized (5) - 2 freq daark-haired (5) - 1 freq rid-haired (5) - 1 freq fair-faced (5) - 3 freq airnhard (6) - 1 freq farmyaird (6) - 1 freq faithered (6) - 3 freq fairmhand (6) - 1 freq fair-heidit (6) - 2 freq airn-hard (6) - 1 freq derk-haired (6) - 1 freq air-raid (6) - 1 freq far-famed (6) - 1 freq fairm-yerd (7) - 1 freq dee-haird (7) - 1 freq flair-burd (7) - 1 freq far-han (7) - 2 freq wird-huird (7) - 3 freq fit-hadd (7) - 1 freq fermyaird (7) - 5 freq |
SoundEx code - F663 forward - 162 freq forwardin - 1 freq forewird - 6 freq forwart - 4 freq furwirds - 1 freq forwards - 5 freq 'foreword' - 1 freq forwird - 2 freq frawart - 2 freq firey-reid - 2 freq forewurd - 1 freq forrard - 3 freq 'forward' - 1 freq foreword - 4 freq forwarded - 2 freq forordnar - 2 freq for'ard - 2 freq forrart - 3 freq forordinar - 1 freq forerede - 1 freq forwaard - 1 freq fair-haired - 1 freq faeryartemis - 1 freq forwirds - 1 freq furwaird - 1 freq ferwerd - 1 freq |
MetaPhone code - FRHRT fair-haired - 1 freq |
FAIR-HAIRED |
| Time to execute Levenshtein function - 0.411315 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.661568 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.031985 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.041029 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.000869 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. |