| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidsman (0) - 2 freq heidman (1) - 1 freq heidsmen (1) - 1 freq heidlan (2) - 1 freq heidspin (2) - 2 freq heidmen (2) - 1 freq heidstane (2) - 14 freq heisan (2) - 1 freq hidan (3) - 3 freq klinsman (3) - 1 freq heidin (3) - 59 freq heidlaun (3) - 1 freq hodman (3) - 1 freq headan (3) - 3 freq heilan (3) - 17 freq herdmen (3) - 2 freq tredsman (3) - 3 freq heidgear (3) - 1 freq reidshank (3) - 1 freq hissan (3) - 1 freq heidspace (3) - 1 freq heidstanes (3) - 10 freq heid-yin (3) - 2 freq handyman (3) - 2 freq henchman (3) - 1 freq |
heidsman (0) - 2 freq heidsmen (1) - 1 freq heidman (2) - 1 freq heidmen (3) - 1 freq heidstane (3) - 14 freq heidspin (3) - 2 freq heidstone (4) - 2 freq hodman (4) - 1 freq woodsman (4) - 1 freq heidsteen (4) - 5 freq heidlan (4) - 1 freq heisan (4) - 1 freq henman (5) - 1 freq huntsman (5) - 2 freq heidyin (5) - 14 freq heid-on (5) - 1 freq heid-stane (5) - 1 freq heedan (5) - 1 freq foirsman (5) - 6 freq herman (5) - 1 freq he-man (5) - 1 freq hudson (5) - 9 freq houseman (5) - 2 freq horseman (5) - 12 freq lodesman (5) - 2 freq |
SoundEx code - H325 hodgson - 2 freq hatchin - 5 freq hoatchin - 9 freq heid-snedder - 5 freq heid-snedder's - 2 freq heid-sneddins - 2 freq het-skinnt - 1 freq hittcn - 1 freq hotchin - 12 freq hootchin - 4 freq hutcheon - 2 freq heid-coont - 66 freq heidsman - 2 freq hudson - 9 freq hedgin-roun - 1 freq hatchan - 1 freq heidsmen - 1 freq haudagainsumm - 1 freq hodgin - 3 freq hitchin - 1 freq heid-quine - 1 freq hidsniffed - 1 freq haud-gauin - 2 freq hdshmumojd - 1 freq hudxxnke - 1 freq haudagain - 1 freq hotsnaxmihole - 1 freq hitching - 1 freq hdshnbw - 1 freq hewitson - 1 freq hdycn - 1 freq |
MetaPhone code - HTSMN heidsman - 2 freq heidsmen - 1 freq |
HEIDSMAN |
| Time to execute Levenshtein function - 0.225122 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.612986 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.064061 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.037316 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.000926 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. |