| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hochled (0) - 1 freq rochled (1) - 2 freq hochlet (1) - 1 freq shochled (1) - 1 freq pochled (1) - 3 freq hoched (1) - 1 freq hochles (1) - 1 freq shoochled (2) - 1 freq heckled (2) - 1 freq hochered (2) - 1 freq hochl't (2) - 2 freq hobbled (2) - 2 freq huckled (2) - 12 freq bachled (2) - 1 freq cockled (2) - 2 freq hechlet (2) - 1 freq soched (2) - 1 freq howled (2) - 15 freq heched (2) - 1 freq cochlea (2) - 2 freq hooled (2) - 1 freq hooched (2) - 3 freq hauchled (2) - 1 freq hotched (2) - 2 freq hechle (2) - 1 freq |
hochled (0) - 1 freq hoched (2) - 1 freq hauchled (2) - 1 freq pochled (2) - 3 freq hochles (2) - 1 freq rochled (2) - 2 freq hochlet (2) - 1 freq shochled (2) - 1 freq hechlet (3) - 1 freq hechle (3) - 1 freq bachled (3) - 1 freq hooched (3) - 3 freq heched (3) - 1 freq hickled (3) - 1 freq hochered (3) - 1 freq heckled (3) - 1 freq shoochled (3) - 1 freq huckled (3) - 12 freq bauchled (4) - 6 freq shauchled (4) - 13 freq trochled (4) - 1 freq peuchled (4) - 1 freq pauchled (4) - 12 freq heuched (4) - 1 freq dauchled (4) - 3 freq |
SoundEx code - H243 haglet - 1 freq huckled - 12 freq heckled - 1 freq hauchled - 1 freq higgeldy-piggeldy - 1 freq hochlet - 1 freq higgledy - 1 freq hoosehold - 12 freq huckelt - 2 freq hochled - 1 freq haggult - 1 freq household - 10 freq heckelt - 1 freq heukelt - 2 freq hoosehald - 1 freq higgledy-piggledy - 1 freq higgelty-piggelty - 1 freq heighlit - 1 freq heich-leid - 1 freq hechl't - 2 freq hochl't - 2 freq hazeldean' - 1 freq hickled - 1 freq hacklet - 1 freq hechlet - 1 freq househald - 2 freq high-heeled - 1 freq hoosehauld - 2 freq hushlet - 1 freq hagglet - 2 freq higgilty - 1 freq hazelheed - 1 freq hooseholds - 1 freq |
MetaPhone code - HXLT hauchled - 1 freq hochlet - 1 freq hochled - 1 freq heich-leid - 1 freq hechl't - 2 freq hochl't - 2 freq hechlet - 1 freq hushlet - 1 freq |
HOCHLED |
| Time to execute Levenshtein function - 0.184693 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.355328 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.028151 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.037490 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.000909 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. |