| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hidlins (0) - 10 freq hidlin (1) - 1 freq hidins (1) - 1 freq hiddlins (1) - 1 freq hiding (2) - 12 freq biddins (2) - 12 freq millins (2) - 1 freq hiddin (2) - 1 freq shillins (2) - 19 freq hiddlin (2) - 4 freq eilins (2) - 4 freq hirlin (2) - 1 freq middlins (2) - 2 freq heidins (2) - 1 freq sidling (2) - 1 freq heilins (2) - 1 freq higgins (2) - 23 freq heidlines (2) - 11 freq tidins (2) - 8 freq hievins (2) - 1 freq hingins (2) - 4 freq aiblins (2) - 282 freq birlins (2) - 1 freq hidin' (2) - 1 freq thirlins (2) - 4 freq |
hidlins (0) - 10 freq heidlans (2) - 1 freq hidlin (2) - 1 freq hiddlins (2) - 1 freq hidins (2) - 1 freq heidlines (2) - 11 freq yirdlins (3) - 1 freq heilins (3) - 1 freq codlins (3) - 4 freq healins (3) - 1 freq hanlins (3) - 1 freq headlines (3) - 6 freq heidline (3) - 13 freq hielans (3) - 17 freq heidins (3) - 1 freq haiflins (3) - 1 freq sidelins (3) - 4 freq heedlines (3) - 1 freq heidyins (3) - 18 freq hallions (4) - 51 freq haudins (4) - 4 freq heilans (4) - 8 freq ailins (4) - 1 freq widdins (4) - 1 freq dailins (4) - 4 freq |
SoundEx code - H345 heidlan - 1 freq heidline - 13 freq howdlin - 1 freq heidlamps - 4 freq hiddlin - 4 freq hoodlums - 1 freq heidlines - 11 freq huddlin-thegither - 1 freq hidlins - 10 freq heidlang - 4 freq heidlans - 1 freq headlang - 2 freq headlines - 6 freq hoddlin - 1 freq heidline's - 1 freq heidlamp - 2 freq headlands - 1 freq hidlin - 1 freq headlamps - 1 freq hiddlins - 1 freq heidlaun - 1 freq huddling - 1 freq hotline - 1 freq headline - 10 freq heedlines - 1 freq huwdwilliams - 1 freq |
MetaPhone code - HTLNS heidlines - 11 freq hidlins - 10 freq heidlans - 1 freq headlines - 6 freq heidline's - 1 freq hiddlins - 1 freq heedlines - 1 freq |
HIDLINS |
| Time to execute Levenshtein function - 0.323269 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.664771 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.028121 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.087802 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.000904 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. |