| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| high-rise (0) - 4 freq highrise (1) - 2 freq high-life (2) - 1 freq highers (3) - 12 freq hiatrist (4) - 1 freq sirprise (4) - 5 freq rigmarie (4) - 2 freq historie (4) - 74 freq heichrife (4) - 1 freq nightie (4) - 1 freq figurine (4) - 2 freq high-born (4) - 1 freq highe (4) - 1 freq uighurs (4) - 20 freq high-up (4) - 1 freq high-class (4) - 3 freq hughie (4) - 107 freq mitherie (4) - 1 freq uighers (4) - 1 freq jig-time (4) - 1 freq hithertae (4) - 4 freq highest (4) - 20 freq itherwise (4) - 59 freq highroad (4) - 6 freq tightrope (4) - 2 freq |
high-rise (0) - 4 freq highrise (2) - 2 freq highers (4) - 12 freq high-life (4) - 1 freq higher (6) - 76 freq dug-rose (6) - 1 freq high-up (6) - 1 freq highways (6) - 3 freq highroad (6) - 6 freq uighurs (6) - 20 freq highs (6) - 1 freq uighers (6) - 1 freq hughesie (6) - 1 freq highlans (6) - 1 freq highness (6) - 1 freq hegris (6) - 2 freq highnessey (6) - 1 freq high-born (6) - 1 freq high-doh (6) - 4 freq high-tech (7) - 2 freq hightailed (7) - 1 freq highpoint (7) - 1 freq hughesms (7) - 1 freq nighbors (7) - 1 freq heigher (7) - 1 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 |
HIGH-RISE |
| Time to execute Levenshtein function - 0.178458 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.333515 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.027618 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.037468 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.000959 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. |