Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
youth-heid (0) - 2 freq youthheid (1) - 11 freq mort-heid (3) - 1 freq hous-heid (3) - 1 freq house-heid (3) - 1 freq pathheid (4) - 1 freq douth-muild (4) - 1 freq loan-heid (4) - 1 freq lochheid (4) - 1 freq adult-heid (4) - 1 freq tounheid (4) - 7 freq haughheid (4) - 1 freq southfield (4) - 1 freq jobby-heid (4) - 1 freq pit-heid (4) - 1 freq mouthed (4) - 1 freq ower-heid (4) - 2 freq south-west (4) - 14 freq sodie-heid (4) - 1 freq blytheheid (4) - 1 freq youthie (4) - 1 freq overheid (5) - 2 freq quyne-heid (5) - 1 freq fourth-year (5) - 1 freq neep-heid (5) - 2 freq |
youth-heid (0) - 2 freq youthheid (2) - 11 freq hous-heid (5) - 1 freq house-heid (5) - 1 freq pit-heid (6) - 1 freq ower-heid (6) - 2 freq sodie-heid (6) - 1 freq thehead (6) - 2 freq tounheid (6) - 7 freq hie-heid (6) - 3 freq loan-heid (6) - 1 freq mort-heid (6) - 1 freq pathheid (6) - 1 freq cave-heid (7) - 2 freq pin-heid (7) - 1 freq shore-heid (7) - 1 freq kale-heid (7) - 1 freq waa-heid (7) - 1 freq waw-heid (7) - 1 freq baw-heid (7) - 1 freq ba-heid (7) - 1 freq arra-heid (7) - 1 freq oathed (7) - 1 freq adult-heid (7) - 1 freq lavy-heid (7) - 1 freq |
SoundEx code - Y330 youthheid - 11 freq youth-heid - 2 freq yowtit - 1 freq ywetht - 1 freq |
MetaPhone code - Y0HT youth-heid - 2 freq |
YOUTH-HEID |
Time to execute Levenshtein function - 0.226520 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.410953 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.038674 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.037421 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.000963 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. |