| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidiepeers (0) - 1 freq heidelberg (4) - 2 freq heidswedgers (4) - 2 freq heidie's (4) - 5 freq heidwatters (4) - 1 freq heidsteens (4) - 4 freq heiders (4) - 4 freq heidies (4) - 4 freq heidbangers (4) - 1 freq sidieweys (5) - 10 freq heidlines (5) - 11 freq leipers (5) - 2 freq heider (5) - 12 freq heidins (5) - 1 freq heidbanger (5) - 5 freq heidgear (5) - 1 freq heidquarters (5) - 5 freq dippers (5) - 4 freq heidatanes (5) - 1 freq widpeckers (5) - 1 freq heifers (5) - 4 freq meidies (5) - 1 freq heidbummery (5) - 7 freq hellyeifers (5) - 1 freq hemisphere (5) - 2 freq |
heidiepeers (0) - 1 freq heiders (5) - 4 freq helpers (6) - 12 freq heidies (6) - 4 freq heidie's (6) - 5 freq herders (7) - 1 freq heidphones (7) - 13 freq andipeters (7) - 8 freq heidcases (7) - 1 freq peepers (7) - 6 freq heiddress (7) - 1 freq cheepers (7) - 1 freq keepers (7) - 16 freq neepers (7) - 5 freq headie-eraa (7) - 1 freq heides (7) - 1 freq helliers (7) - 1 freq heid-anes (7) - 1 freq hauders (7) - 3 freq heidaches (7) - 2 freq peediepuss (7) - 13 freq haiverers (7) - 1 freq heefers (7) - 1 freq neipers (7) - 2 freq heidless (7) - 12 freq |
SoundEx code - H316 heidbrandy - 1 freq heid-first - 2 freq heid-furst - 1 freq heidboard - 3 freq heid-board - 1 freq heid-brandy - 1 freq heidfirst - 2 freq hot-press - 1 freq headboard - 1 freq hat-preens - 1 freq hit-forms - 1 freq hadubrand - 4 freq heidiepeers - 1 freq heedfirst - 1 freq |
MetaPhone code - HTPRS hot-press - 1 freq heidiepeers - 1 freq |
HEIDIEPEERS |
| Time to execute Levenshtein function - 0.493248 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.820580 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.072106 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.043016 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.000845 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. |