| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highers (0) - 12 freq higher (1) - 76 freq uighers (1) - 1 freq hinders (2) - 2 freq highest (2) - 20 freq nithers (2) - 1 freq highe (2) - 1 freq fishers (2) - 13 freq hither (2) - 6 freq highs (2) - 1 freq signers (2) - 1 freq tighes (2) - 1 freq withers (2) - 5 freq fighters (2) - 4 freq eithers (2) - 1 freq figgers (2) - 1 freq hinners (2) - 5 freq heigher (2) - 1 freq thiggers (2) - 1 freq hikers (2) - 2 freq uighurs (2) - 20 freq shithers (2) - 1 freq biggers (2) - 9 freq aithers (2) - 7 freq diggers (2) - 1 freq |
highers (0) - 12 freq uighers (2) - 1 freq higher (2) - 76 freq highs (3) - 1 freq hughes (3) - 5 freq heigher (3) - 1 freq uighurs (3) - 20 freq highrise (3) - 2 freq lighters (4) - 3 freq nighbers (4) - 11 freq highness (4) - 1 freq hicher (4) - 1 freq tigers (4) - 5 freq hingers (4) - 5 freq fithers (4) - 4 freq high-rise (4) - 4 freq highways (4) - 3 freq hugh's (4) - 4 freq hughie's (4) - 6 freq heathers (4) - 1 freq heights (4) - 3 freq tithers (4) - 1 freq finghers (4) - 1 freq ithers (4) - 574 freq mithers (4) - 79 freq |
SoundEx code - H262 houswark - 1 freq hoosewark - 5 freq high-rise - 4 freq hcro's - 1 freq hookers - 2 freq hoosework - 6 freq highers - 12 freq hoosewirk - 2 freq hoo's-yersel - 2 freq howkers - 1 freq hacker's - 1 freq hause-rigid - 1 freq highrise - 2 freq hege-raws - 1 freq heckers - 1 freq housework - 3 freq hikers - 2 freq hoose-work - 1 freq hqrkwrq - 1 freq hawkergoldie - 1 freq hegris - 2 freq hackers - 1 freq hooswark - 1 freq |
MetaPhone code - HFRS havers - 35 freq haivers - 31 freq high-rise - 4 freq 'havers - 1 freq 'haivers - 4 freq heifers - 2 freq highers - 12 freq haufers - 4 freq hovers - 3 freq hoover's - 1 freq highrise - 2 freq €œhavers - 2 freq heffers - 1 freq heefers - 1 freq |
HIGHERS |
| Time to execute Levenshtein function - 0.198765 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.434481 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.033552 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.052110 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.001162 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. |