| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidlines (0) - 11 freq heidline (1) - 13 freq heedlines (1) - 1 freq heidline's (1) - 1 freq headlines (1) - 6 freq headline (2) - 10 freq heid-anes (2) - 1 freq hidlins (2) - 10 freq heidlans (2) - 1 freq heidins (2) - 1 freq heidyins (2) - 18 freq deidline (2) - 1 freq heidies (2) - 4 freq heilins (2) - 1 freq herdins (3) - 3 freq declines (3) - 1 freq hairline (3) - 3 freq heivins (3) - 2 freq hidlin (3) - 1 freq guidelines (3) - 26 freq heidphones (3) - 13 freq seedlies (3) - 7 freq helpline (3) - 10 freq heid-yins (3) - 1 freq deidliest (3) - 1 freq |
heidlines (0) - 11 freq heedlines (1) - 1 freq headlines (1) - 6 freq heidline (2) - 13 freq heidline's (2) - 1 freq heidlans (2) - 1 freq hidlins (2) - 10 freq heilins (3) - 1 freq heidyins (3) - 18 freq heidins (3) - 1 freq headline (3) - 10 freq heid-anes (3) - 1 freq haiflins (4) - 1 freq heilans (4) - 8 freq heid-yins (4) - 1 freq heidless (4) - 12 freq heidlang (4) - 4 freq sidelines (4) - 2 freq heidlan (4) - 1 freq hiddlins (4) - 1 freq hidins (4) - 1 freq heidies (4) - 4 freq deidline (4) - 1 freq guidelines (4) - 26 freq headlands (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 - HTLNS heidlines - 11 freq hidlins - 10 freq heidlans - 1 freq headlines - 6 freq heidline's - 1 freq hiddlins - 1 freq heedlines - 1 freq |
HEIDLINES |
| Time to execute Levenshtein function - 0.248852 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.399424 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.027519 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.045290 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.000838 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. |