| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highest (0) - 21 freq heighest (1) - 2 freq digeest (2) - 1 freq highe (2) - 1 freq himmest (2) - 4 freq heichest (2) - 24 freq hight (2) - 2 freq highness (2) - 1 freq bigest (2) - 1 freq hughes (2) - 5 freq tighes (2) - 1 freq hugest (2) - 1 freq lightest (2) - 2 freq biggest (2) - 141 freq digest (2) - 5 freq richest (2) - 8 freq higher (2) - 79 freq laighest (2) - 1 freq eithest (2) - 1 freq highs (2) - 1 freq highers (2) - 12 freq might (3) - 421 freq hinmost (3) - 1 freq i'best (3) - 7 freq liefest (3) - 2 freq |
highest (0) - 21 freq heighest (1) - 2 freq laighest (3) - 1 freq hughes (3) - 5 freq hight (3) - 2 freq heichest (3) - 24 freq hugest (3) - 1 freq highs (3) - 1 freq aghast (4) - 3 freq height (4) - 45 freq highers (4) - 12 freq ghost (4) - 73 freq roughest (4) - 3 freq toughest (4) - 4 freq heighlit (4) - 1 freq hughesie (4) - 1 freq eithest (4) - 1 freq higher (4) - 79 freq himmest (4) - 4 freq highe (4) - 1 freq digeest (4) - 1 freq bigest (4) - 1 freq highness (4) - 1 freq tighes (4) - 1 freq lightest (4) - 2 freq |
SoundEx code - H223 heichest - 24 freq housecoat - 2 freq highest - 21 freq hugest - 1 freq hijacked - 2 freq heich-stannèrt - 1 freq heighest - 2 freq hege-syde - 1 freq high-status - 2 freq heychesters - 2 freq heychester - 1 freq hescastle - 1 freq hoosecoat - 2 freq hoosecoats - 1 freq |
MetaPhone code - HFST heavy-set - 1 freq highest - 21 freq hivviest - 1 freq heaviest - 2 freq |
HIGHEST high - 619 freq higher - 79 freq highest - 21 freq |
| Time to execute Levenshtein function - 0.184985 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.357116 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.029306 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.037967 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.000902 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. |