| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hadrian (3) - 6 freq hadrian's (3) - 4 freq adrian (4) - 4 freq harin (5) - 2 freq variance (5) - 2 freq carian (5) - 1 freq hairyangus (5) - 9 freq harrans (5) - 1 freq radiance (5) - 1 freq harman's (5) - 1 freq variants (5) - 14 freq radiant (5) - 5 freq haddan (5) - 2 freq harkan (5) - 2 freq hardanger (5) - 1 freq haroan (5) - 1 freq hairband (5) - 1 freq hadrons (5) - 1 freq haddin (5) - 15 freq adriatic (5) - 2 freq adrienne (5) - 1 freq adrianflux (5) - 1 freq marianna (5) - 1 freq hadean (5) - 3 freq harangue (5) - 1 freq |
hadrian (6) - 6 freq hadrian's (6) - 4 freq hadrons (8) - 1 freq adrian (8) - 4 freq haddin (9) - 15 freq haroan (9) - 1 freq hadean (9) - 3 freq hairin (9) - 3 freq harangue (9) - 1 freq haddan (9) - 2 freq adrianflux (9) - 1 freq adrienne (9) - 1 freq harrans (9) - 1 freq harin (9) - 2 freq hairyangus (9) - 9 freq quadrant (10) - 2 freq hadni (10) - 1 freq o'drink (10) - 1 freq haidna (10) - 2 freq haddington (10) - 7 freq hodgin (10) - 3 freq haadan (10) - 2 freq haparanda (10) - 1 freq havering (10) - 2 freq dauran (10) - 1 freq |
SoundEx code - H365 howderin - 3 freq hawthorn - 3 freq hotterin - 15 freq hadrons - 1 freq hotteran - 1 freq hadrian's - 4 freq heedrum-hodrums - 28 freq 'heedrum-hodrums - 2 freq 'heedrum - 1 freq hodrums - 1 freq heedrum-hodrumland - 1 freq heedrum-hodrumss - 2 freq heedrum-hodrum - 18 freq heedrumhodrum - 3 freq heedrum-hodrumish - 1 freq heedrumhodrums - 6 freq 'heedrum-hodrum - 4 freq heedrum-hodrum's - 1 freq hither-an-yon - 2 freq hadrian - 6 freq hodrum - 1 freq hyterin - 3 freq haterent - 1 freq heteronormative - 2 freq headroom - 1 freq heathermc - 8 freq heathermorven - 1 freq |
MetaPhone code - HTRN howderin - 3 freq hotterin - 15 freq hotteran - 1 freq hadrian - 6 freq |
HADRIAN� |
| Time to execute Levenshtein function - 0.200872 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.378909 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.034486 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.039536 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.000954 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. |