| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| youthheid (0) - 11 freq youth-heid (1) - 2 freq pathheid (3) - 1 freq lochheid (3) - 1 freq mort-heid (3) - 1 freq hous-heid (3) - 1 freq youthie (3) - 1 freq haughheid (3) - 1 freq mouthed (3) - 1 freq tounheid (3) - 7 freq hotched (4) - 2 freq adult-heid (4) - 1 freq souched (4) - 6 freq couthie (4) - 70 freq fauseheid (4) - 1 freq potsherd (4) - 1 freq loan-heid (4) - 1 freq toonheid (4) - 1 freq moothed (4) - 4 freq southwell (4) - 1 freq touched (4) - 75 freq foreheid (4) - 22 freq soughed (4) - 1 freq forcheid (4) - 1 freq touther (4) - 1 freq |
youthheid (0) - 11 freq youth-heid (2) - 2 freq tounheid (4) - 7 freq pathheid (4) - 1 freq lochheid (5) - 1 freq oathed (5) - 1 freq toonheid (5) - 1 freq touched (5) - 75 freq thehead (5) - 2 freq mouthed (5) - 1 freq youthie (5) - 1 freq threid (5) - 60 freq haughheid (5) - 1 freq youths (6) - 6 freq pitheid (6) - 2 freq soothed (6) - 4 freq thread (6) - 15 freq owerheid (6) - 15 freq theyd (6) - 10 freq outhir (6) - 1 freq youthful (6) - 3 freq youthfa (6) - 1 freq upheid (6) - 1 freq youth's (6) - 2 freq roughed (6) - 1 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.197005 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.346360 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.028266 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.038736 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.000853 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. |