| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arhin (0) - 1 freq arcin (1) - 2 freq archin (1) - 1 freq athin (1) - 226 freq aahin (1) - 3 freq awhin (1) - 1 freq ahin (1) - 262 freq achin (1) - 14 freq ahid (2) - 2 freq aidin (2) - 1 freq farmin (2) - 1 freq airtin (2) - 36 freq aimin (2) - 10 freq frein (2) - 36 freq lehin (2) - 4 freq a'hing (2) - 4 freq warmin (2) - 30 freq nuhin (2) - 48 freq warrin (2) - 1 freq ax'in (2) - 1 freq aksin (2) - 13 freq sartin (2) - 6 freq naehin (2) - 3 freq pryin (2) - 1 freq rin (2) - 453 freq |
arhin (0) - 1 freq achin (2) - 14 freq rhine (2) - 2 freq rhino (2) - 3 freq awhin (2) - 1 freq ahin (2) - 262 freq archin (2) - 1 freq arcin (2) - 2 freq athin (2) - 226 freq aahin (2) - 3 freq ithin (3) - 124 freq nohin (3) - 1 freq aran (3) - 5 freq arisin (3) - 1 freq arguin (3) - 16 freq rtin (3) - 1 freq trehin (3) - 7 freq baehin (3) - 11 freq airchin (3) - 3 freq achan (3) - 2 freq orain (3) - 1 freq yarkin (3) - 4 freq arun (3) - 2 freq suhin (3) - 71 freq anyhin (3) - 69 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 - ARHN arhin - 1 freq |
ARHIN |
| Time to execute Levenshtein function - 0.319313 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.426570 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.034736 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.049126 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.001132 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. |