| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| youthheid (0) - 11 freq youth-heid (1) - 2 freq mort-heid (3) - 1 freq mouthed (3) - 1 freq lochheid (3) - 1 freq tounheid (3) - 7 freq youthie (3) - 1 freq pathheid (3) - 1 freq hous-heid (3) - 1 freq haughheid (3) - 1 freq southren (4) - 3 freq house-heid (4) - 1 freq southers (4) - 1 freq douted (4) - 1 freq roughed (4) - 1 freq loan-heid (4) - 1 freq outed (4) - 2 freq souched (4) - 6 freq couthie (4) - 71 freq butched (4) - 2 freq loathed (4) - 2 freq southert (4) - 1 freq lochhead (4) - 24 freq porkheid (4) - 1 freq withheld (4) - 1 freq |
youthheid (0) - 11 freq youth-heid (2) - 2 freq pathheid (4) - 1 freq tounheid (4) - 7 freq haughheid (5) - 1 freq touched (5) - 75 freq threid (5) - 60 freq thehead (5) - 2 freq youthie (5) - 1 freq toonheid (5) - 1 freq oathed (5) - 1 freq mouthed (5) - 1 freq lochheid (5) - 1 freq hotched (6) - 2 freq theyd (6) - 8 freq bothed (6) - 1 freq pit-heid (6) - 1 freq soughed (6) - 1 freq upheid (6) - 1 freq youth (6) - 130 freq overheid (6) - 2 freq botherd (6) - 1 freq pitheid (6) - 2 freq fauseheid (6) - 1 freq bothied (6) - 2 freq |
SoundEx code - Y330 youthheid - 11 freq youth-heid - 2 freq yowtit - 1 freq ywetht - 1 freq |
MetaPhone code - Y0T youthheid - 11 freq |
YOUTHHEID |
| Time to execute Levenshtein function - 0.218070 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.371275 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.027523 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.038656 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.000965 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. |