| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| helliers (0) - 1 freq nellie's (2) - 3 freq hellery (2) - 3 freq heller (2) - 3 freq bellies (2) - 22 freq hollies (2) - 2 freq hillies (2) - 11 freq hellie (2) - 1 freq helpers (2) - 12 freq sellers (2) - 2 freq hallies (2) - 1 freq colliers (2) - 1 freq wellies (2) - 16 freq tellies (2) - 5 freq tellers (2) - 5 freq howlers (3) - 1 freq bullers (3) - 2 freq rollies (3) - 1 freq feller (3) - 1 freq keillies (3) - 1 freq mellie (3) - 2 freq sillies (3) - 1 freq heckers (3) - 1 freq feelers (3) - 1 freq heirs (3) - 8 freq |
helliers (0) - 1 freq sellers (3) - 2 freq hallies (3) - 1 freq colliers (3) - 1 freq tellers (3) - 5 freq hillies (3) - 11 freq helpers (3) - 12 freq heller (3) - 3 freq hollies (3) - 2 freq hellery (3) - 3 freq pillers (4) - 2 freq allers (4) - 1 freq holders (4) - 3 freq hallis (4) - 1 freq callers (4) - 2 freq keillers (4) - 1 freq killers (4) - 9 freq folloers (4) - 1 freq follaers (4) - 108 freq hellyeifers (4) - 1 freq cellars (4) - 1 freq hellyiefers (4) - 1 freq hells (4) - 1 freq cullers (4) - 1 freq hallions (4) - 51 freq |
SoundEx code - H462 hallirackit - 1 freq hillayerious - 1 freq hillaireous - 1 freq hilariously - 1 freq hilarious - 18 freq hallyrackit - 1 freq howlers - 1 freq helliers - 1 freq hell-owercappin - 1 freq haillierakkit - 1 freq hallierackit - 5 freq haillerackit - 2 freq |
MetaPhone code - HLRS hillaireous - 1 freq hilarious - 18 freq howlers - 1 freq helliers - 1 freq |
HELLIERS |
| Time to execute Levenshtein function - 0.216972 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.378740 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.029017 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.039680 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.001011 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. |