| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vieween (0) - 1 freq viewin (2) - 3 freq viewer (2) - 4 freq seween (2) - 1 freq beween (2) - 1 freq bitween (2) - 2 freq viewers (2) - 6 freq vikeen (2) - 2 freq viewed (2) - 9 freq a'tween (3) - 1 freq sixteen (3) - 44 freq baetween (3) - 4 freq liveen (3) - 5 freq ringeen (3) - 1 freq 'tween (3) - 1 freq naeweel (3) - 1 freq vievie (3) - 1 freq middeen (3) - 2 freq spoween (3) - 1 freq lineen (3) - 1 freq shebeen (3) - 1 freq killeen (3) - 1 freq mindeen (3) - 5 freq miewed (3) - 2 freq ewen (3) - 7 freq |
vieween (0) - 1 freq viewin (2) - 3 freq vikeen (3) - 2 freq viewed (3) - 9 freq beween (3) - 1 freq viewer (3) - 4 freq seween (3) - 1 freq eveneen (4) - 4 freq tween (4) - 2 freq goween (4) - 1 freq arween (4) - 1 freq views (4) - 60 freq hoween (4) - 1 freq vixen (4) - 1 freq view (4) - 246 freq atween (4) - 1053 freq aween (4) - 1 freq ewen (4) - 7 freq ween (4) - 25 freq wieen (4) - 1 freq viewin' (4) - 1 freq viewing (4) - 6 freq viewers (4) - 6 freq bitween (4) - 2 freq tewin (5) - 1 freq |
SoundEx code - V500 vn - 2 freq vaam - 3 freq van - 161 freq vouin - 1 freq vain - 30 freq vine - 25 freq viewin - 3 freq vin - 6 freq vein - 5 freq vino - 10 freq veni - 1 freq veiny - 2 freq venue - 16 freq vannie - 4 freq vhan - 1 freq vannae - 1 freq vienna - 4 freq vinny' - 1 freq vom - 1 freq v¥in - 1 freq vinna - 1 freq vieween - 1 freq viewin' - 1 freq vinnie - 7 freq vinny - 2 freq von - 1 freq vpoun - 1 freq vpon - 1 freq vann - 3 freq vyin - 1 freq vim - 1 freq vini - 2 freq vonny - 2 freq vmmw - 1 freq vm - 11 freq vem - 1 freq vpn - 1 freq vfmn - 1 freq venn - 1 freq vaina - 1 freq vimeo - 2 freq vhn - 1 freq vvmhuh - 1 freq |
MetaPhone code - FWN fawin - 88 freq fawen - 9 freq viewin - 3 freq fawin' - 1 freq vieween - 1 freq viewin' - 1 freq |
VIEWEEN |
| Time to execute Levenshtein function - 0.379076 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.668577 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.028726 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.037576 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.000855 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. |