| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harm (0) - 21 freq charm (1) - 30 freq harp (1) - 9 freq harem (1) - 1 freq hare (1) - 199 freq har (1) - 8 freq garm (1) - 1 freq hard (1) - 782 freq hari (1) - 1 freq harr (1) - 2 freq harl (1) - 5 freq herm (1) - 49 freq ham (1) - 49 freq haim (1) - 30 freq karm (1) - 2 freq hamm (1) - 1 freq hark (1) - 15 freq farm (1) - 28 freq hart (1) - 28 freq harn (1) - 3 freq haem (1) - 53 freq warm (1) - 355 freq arm (1) - 50 freq hairm (1) - 63 freq harz (1) - 1 freq |
harm (0) - 21 freq herm (1) - 49 freq hairm (1) - 63 freq harem (1) - 1 freq farm (2) - 28 freq hark (2) - 15 freq hamm (2) - 1 freq hart (2) - 28 freq haem (2) - 53 freq harz (2) - 1 freq arm (2) - 50 freq karm (2) - 2 freq harn (2) - 3 freq warm (2) - 355 freq har (2) - 8 freq harp (2) - 9 freq haim (2) - 30 freq charm (2) - 30 freq garm (2) - 1 freq hare (2) - 199 freq hard (2) - 782 freq harl (2) - 5 freq ham (2) - 49 freq harr (2) - 2 freq hari (2) - 1 freq |
SoundEx code - H650 heron - 13 freq hairm - 63 freq hearin - 174 freq hornie - 5 freq hurryin - 6 freq horn - 57 freq herrin - 23 freq haroan - 1 freq herm - 49 freq hureheon - 1 freq harm - 21 freq harn - 3 freq heerin - 3 freq horne - 2 freq herryin - 2 freq hearan - 14 freq heroin - 5 freq heeren - 2 freq herrin' - 5 freq hearin' - 1 freq heroine - 6 freq herein - 7 freq hirin - 3 freq hirin' - 1 freq hairin - 3 freq hoorin - 3 freq harin - 2 freq h'r'm - 1 freq herin - 2 freq hurrin - 1 freq hoarn - 1 freq hraun - 1 freq 'hearan' - 1 freq hurryan - 1 freq hearna - 1 freq harrowin - 2 freq heirin - 2 freq hurin - 1 freq herriein - 1 freq hooerin - 1 freq herrien - 1 freq harne - 2 freq hoorin' - 3 freq harem - 1 freq horny - 1 freq hernia - 1 freq |
MetaPhone code - HRM hairm - 63 freq herm - 49 freq harm - 21 freq harem - 1 freq |
HARM |
| Time to execute Levenshtein function - 0.178373 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.349155 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.027392 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.037944 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.000982 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. |