Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arween (0) - 1 freq atween (1) - 1053 freq aween (1) - 1 freq freen (2) - 220 freq aeteen (2) - 1 freq 'atween (2) - 1 freq awee (2) - 5 freq aren (2) - 3 freq aweel (2) - 4 freq goween (2) - 1 freq ahtween (2) - 2 freq aiteen (2) - 1 freq seween (2) - 1 freq aweet (2) - 1 freq treen (2) - 4 freq acheen (2) - 1 freq atweel (2) - 26 freq berween (2) - 1 freq abeeen (2) - 1 freq 'tween (2) - 1 freq hoween (2) - 1 freq a-wee (2) - 3 freq aleen (2) - 97 freq asweel (2) - 18 freq atwien (2) - 2 freq |
arween (0) - 1 freq aween (2) - 1 freq atween (2) - 1053 freq erwin (3) - 1 freq tween (3) - 2 freq hoween (3) - 1 freq berween (3) - 1 freq atwein (3) - 46 freq atwien (3) - 2 freq atwen (3) - 1 freq arden (3) - 2 freq erowen (3) - 1 freq beween (3) - 1 freq argeein (3) - 2 freq rowein (3) - 7 freq arisen (3) - 4 freq ween (3) - 25 freq goween (3) - 1 freq aren (3) - 3 freq seween (3) - 1 freq riseen (4) - 2 freq arlene (4) - 13 freq raceen (4) - 1 freq growein (4) - 42 freq wen (4) - 18 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 - ARWN arween - 1 freq |
ARWEEN |
Time to execute Levenshtein function - 0.418663 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.532710 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.030851 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.039183 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.001914 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. |