| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ahern (0) - 1 freq apern (1) - 1 freq ahein (1) - 1 freq thern (1) - 1 freq aferr (2) - 1 freq here (2) - 4207 freq hert (2) - 770 freq avery (2) - 2 freq cern (2) - 1 freq 'hen (2) - 4 freq adorn (2) - 6 freq 'here (2) - 51 freq aleen (2) - 97 freq hers (2) - 85 freq her' (2) - 2 freq sherk (2) - 1 freq atein (2) - 4 freq amean (2) - 1 freq ageen (2) - 111 freq athein (2) - 1 freq horn (2) - 59 freq ayrn (2) - 1 freq acer (2) - 1 freq avera (2) - 1 freq shewn (2) - 14 freq |
ahern (0) - 1 freq horn (2) - 59 freq herin (2) - 2 freq heron (2) - 13 freq harn (2) - 5 freq apern (2) - 1 freq ahein (2) - 1 freq thern (2) - 1 freq herk (3) - 3 freq yhere (3) - 1 freq leern (3) - 1 freq herm (3) - 51 freq hein (3) - 2 freq ahaun (3) - 1 freq bern (3) - 10 freq ahenny (3) - 1 freq herr (3) - 9 freq herd (3) - 158 freq hen (3) - 415 freq churn (3) - 4 freq herz (3) - 1 freq thorn (3) - 9 freq ern (3) - 14 freq herc (3) - 1 freq her- (3) - 1 freq |
SoundEx code - A650 airm - 358 freq aroon - 576 freq army - 82 freq airn - 52 freq arenae - 88 freq aroun - 129 freq arena - 41 freq airmy - 92 freq arm - 52 freq arnae - 18 freq airm' - 1 freq arrum - 7 freq arna - 23 freq awroon - 1 freq airmie - 15 freq airin - 4 freq aroon' - 4 freq aroma - 7 freq arhin - 1 freq aurum - 1 freq aran - 5 freq ah'rm - 1 freq arran - 15 freq aaron - 5 freq arni - 3 freq armoy - 1 freq arne - 1 freq arnie - 5 freq arween - 1 freq arun - 2 freq aroun' - 6 freq aireamh - 2 freq aroion - 1 freq €˜army - 1 freq aren - 3 freq 'airm' - 1 freq areni - 1 freq airon - 1 freq €œarran - 1 freq ahern - 1 freq ayrn - 1 freq aeaeron - 5 freq aoirmh - 1 freq 'army - 1 freq 'army' - 1 freq arounÂ’ - 1 freq |
MetaPhone code - AHRN ahern - 1 freq |
AHERN |
| Time to execute Levenshtein function - 0.209639 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.350459 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.036231 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.037228 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.000941 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. |