Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hochered (0) - 1 freq tochered (1) - 4 freq snochered (2) - 1 freq hochled (2) - 1 freq nichered (2) - 4 freq pyochered (2) - 3 freq bothered (2) - 59 freq fichered (2) - 1 freq hollered (2) - 5 freq hottered (2) - 6 freq hoovered (2) - 4 freq hovered (2) - 11 freq hoched (2) - 1 freq tichered (2) - 2 freq hoppened (3) - 1 freq hattered (3) - 7 freq lichened (3) - 2 freq touered (3) - 1 freq heathered (3) - 1 freq dovered (3) - 6 freq houchter'd (3) - 1 freq foonered (3) - 1 freq stachered (3) - 4 freq pokered (3) - 1 freq hochlet (3) - 1 freq |
hochered (0) - 1 freq tochered (2) - 4 freq fichered (3) - 1 freq hoched (3) - 1 freq pyochered (3) - 3 freq nichered (3) - 4 freq tichered (3) - 2 freq hochled (3) - 1 freq heathered (4) - 1 freq cheered (4) - 27 freq hicher (4) - 1 freq heched (4) - 1 freq anchored (4) - 10 freq chored (4) - 9 freq hooched (4) - 3 freq hoovered (4) - 4 freq hottered (4) - 6 freq bothered (4) - 59 freq hovered (4) - 11 freq snochered (4) - 1 freq hollered (4) - 5 freq hungered (5) - 4 freq bithered (5) - 2 freq shithered (5) - 2 freq soothered (5) - 3 freq |
SoundEx code - H263 hogwarts - 1 freq hie-cairt - 1 freq haggart - 3 freq hazardous - 1 freq hochered - 1 freq hazard - 2 freq hsard - 1 freq haizarts - 1 freq €˜hagrid - 1 freq highroad - 6 freq hazards - 1 freq haggardhawks - 2 freq haggard - 1 freq |
MetaPhone code - HXRT hochered - 1 freq |
HOCHERED |
Time to execute Levenshtein function - 0.238459 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.366436 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.028054 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.042073 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.000897 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. |