| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| healer (0) - 1 freq heller (1) - 3 freq healed (1) - 10 freq dealer (1) - 15 freq hearer (1) - 1 freq header (1) - 2 freq heater (1) - 13 freq healy (2) - 4 freq hales (2) - 1 freq helley (2) - 1 freq haley (2) - 1 freq healt (2) - 11 freq heather (2) - 104 freq heer (2) - 19 freq halper (2) - 2 freq beaver (2) - 3 freq efler (2) - 1 freq heaters (2) - 5 freq geller (2) - 1 freq beaker (2) - 6 freq aaler (2) - 17 freq wheeler (2) - 4 freq heeder (2) - 1 freq bearer (2) - 7 freq teller (2) - 1 freq |
healer (0) - 1 freq heater (2) - 13 freq hooler (2) - 1 freq houler (2) - 1 freq header (2) - 2 freq hauler (2) - 1 freq heller (2) - 3 freq hearer (2) - 1 freq healed (2) - 10 freq dealer (2) - 15 freq haaled (3) - 21 freq hever (3) - 2 freq caaler (3) - 1 freq hitler (3) - 10 freq heeled (3) - 1 freq hear (3) - 1383 freq halter (3) - 5 freq hater (3) - 2 freq whaler (3) - 1 freq heeter (3) - 9 freq hazer (3) - 1 freq haaver (3) - 4 freq heals (3) - 5 freq peeler (3) - 3 freq beyler (3) - 1 freq |
SoundEx code - H460 hellery - 3 freq hillary - 1 freq houler - 1 freq hauler - 1 freq healer - 1 freq hooler - 1 freq hilary - 2 freq holler - 2 freq 'heller' - 1 freq heller - 3 freq |
MetaPhone code - HLR hellery - 3 freq hillary - 1 freq houler - 1 freq hauler - 1 freq healer - 1 freq hooler - 1 freq hilary - 2 freq holler - 2 freq 'heller' - 1 freq heller - 3 freq |
HEALER |
| Time to execute Levenshtein function - 0.312195 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.491633 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.069804 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.078743 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.000872 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. |