Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
atweill (0) - 27 freq asweill (1) - 2 freq aweill (1) - 6 freq aswell (2) - 6 freq atweel (2) - 26 freq 'weill (2) - 11 freq twill (2) - 1 freq alsweill (2) - 1 freq atwein (2) - 45 freq weill (2) - 374 freq €œatweill (2) - 1 freq awfill (2) - 1 freq atill (2) - 3 freq €˜weill (2) - 1 freq €œweill (2) - 35 freq -well (3) - 2 freq atween (3) - 1049 freq 'well (3) - 52 freq awei (3) - 1 freq atein (3) - 4 freq leill (3) - 1 freq we'll (3) - 569 freq 'will (3) - 25 freq €œwell (3) - 23 freq att'll (3) - 2 freq |
atweill (0) - 27 freq aweill (2) - 6 freq twill (2) - 1 freq asweill (2) - 2 freq atweel (3) - 26 freq weill (3) - 374 freq aswell (3) - 6 freq atill (3) - 3 freq 'weill (3) - 11 freq twall (3) - 3 freq sowell (4) - 1 freq sewell (4) - 1 freq swell (4) - 17 freq twel (4) - 1 freq wuill (4) - 1 freq at'll (4) - 15 freq theyll (4) - 5 freq atholl (4) - 1 freq well (4) - 1423 freq taill (4) - 54 freq swill (4) - 2 freq fitwell (4) - 1 freq till (4) - 2486 freq thill (4) - 1 freq orwell (4) - 4 freq |
SoundEx code - A340 'atweel - 3 freq aat'll - 8 freq at'll - 15 freq atweill - 27 freq aidle - 1 freq atal - 2 freq att'il - 2 freq att'll - 2 freq atil - 17 freq ah'tl - 1 freq atill - 3 freq atall - 2 freq atholl - 1 freq atli - 1 freq 'atli - 2 freq atweel - 26 freq €œatweill - 1 freq adele - 1 freq €œatweel - 1 freq aideeal - 1 freq 'at'll - 1 freq atl - 2 freq athol - 1 freq aht'll - 2 freq adela - 4 freq |
MetaPhone code - ATWL 'atweel - 3 freq atweill - 27 freq atweel - 26 freq €œatweill - 1 freq €œatweel - 1 freq |
ATWEILL |
Time to execute Levenshtein function - 0.176962 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.346125 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.028027 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.039421 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.000896 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. |