| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| headline (0) - 10 freq deadline (1) - 4 freq headlines (1) - 6 freq heidline (1) - 13 freq headone (2) - 1 freq healin' (2) - 1 freq healins (2) - 1 freq helpline (2) - 10 freq heidlines (2) - 11 freq deidline (2) - 1 freq headin (2) - 45 freq headlang (2) - 2 freq healin (2) - 8 freq heading (2) - 22 freq headie (2) - 1 freq heatlie (2) - 3 freq heedlines (2) - 1 freq healing (2) - 7 freq leadsie (3) - 1 freq deedlie (3) - 1 freq snawline (3) - 1 freq huddling (3) - 1 freq heelie (3) - 3 freq hearins (3) - 1 freq headan (3) - 3 freq |
headline (0) - 10 freq heidline (1) - 13 freq deadline (2) - 4 freq headlines (2) - 6 freq healin (3) - 8 freq headlang (3) - 2 freq heidlan (3) - 1 freq hidlin (3) - 1 freq headin (3) - 45 freq heedlines (3) - 1 freq deidline (3) - 1 freq headone (3) - 1 freq heidlines (3) - 11 freq hidlins (4) - 10 freq haulin (4) - 19 freq hoadin (4) - 3 freq heidlang (4) - 4 freq haalin (4) - 9 freq heidin (4) - 58 freq hoddlin (4) - 1 freq dealin (4) - 30 freq heedin (4) - 11 freq seedlin (4) - 2 freq halin (4) - 1 freq heidlans (4) - 1 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 - HTLN heidlan - 1 freq heidline - 13 freq howdlin - 1 freq hiddlin - 4 freq hoddlin - 1 freq hidlin - 1 freq heidlaun - 1 freq hotline - 1 freq headline - 10 freq |
HEADLINE |
| Time to execute Levenshtein function - 0.190333 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.342775 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.028916 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.036930 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.000809 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. |