| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harrowin (0) - 2 freq narrowin (1) - 5 freq harrowing (1) - 1 freq harrowtn (1) - 1 freq burrowin (2) - 2 freq narrowing (2) - 1 freq furrowin (2) - 1 freq borrowin (2) - 5 freq harrow (2) - 2 freq harrouis (2) - 1 freq yarrows (3) - 1 freq sharron (3) - 3 freq hyowin (3) - 2 freq harkin (3) - 5 freq harpoon (3) - 8 freq parrafin (3) - 1 freq carron (3) - 4 freq harrot (3) - 3 freq harrod's (3) - 3 freq hard-won (3) - 2 freq herryin (3) - 2 freq hallowit (3) - 1 freq barrows (3) - 1 freq hairpin (3) - 3 freq carryin (3) - 16 freq |
harrowin (0) - 2 freq narrowin (2) - 5 freq harrowtn (2) - 1 freq harrowing (2) - 1 freq harrow (3) - 2 freq borrowin (3) - 5 freq furrowin (3) - 1 freq burrowin (3) - 2 freq harrison (4) - 5 freq hurryin (4) - 6 freq herriein (4) - 1 freq herryin (4) - 2 freq hurrin (4) - 1 freq herrin (4) - 24 freq narrowing (4) - 1 freq harrouis (4) - 1 freq marrow (5) - 32 freq rowin (5) - 30 freq growin (5) - 240 freq crowin (5) - 2 freq earrin (5) - 1 freq barrowfu (5) - 2 freq harknin (5) - 1 freq harin (5) - 2 freq jarrin (5) - 2 freq |
SoundEx code - H650 heron - 13 freq hairm - 63 freq hearin - 174 freq hornie - 5 freq hurryin - 6 freq horn - 59 freq herrin - 24 freq haroan - 1 freq herm - 51 freq hureheon - 1 freq harm - 22 freq harn - 5 freq heerin - 3 freq horne - 2 freq herryin - 2 freq hearan - 14 freq heroin - 5 freq heeren - 2 freq herrin' - 5 freq hearin' - 2 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 - HRWN harrowin - 2 freq |
HARROWIN |
| Time to execute Levenshtein function - 0.447722 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.557032 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.072185 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.064093 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.000916 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. |