Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
awpr (0) - 11 freq awar (1) - 4 freq xwpa (2) - 1 freq awaa (2) - 103 freq apd (2) - 2 freq awjh (2) - 1 freq awae (2) - 22 freq 'wur (2) - 3 freq aar (2) - 5 freq awe (2) - 396 freq wor (2) - 20 freq amp (2) - 10 freq awaur (2) - 43 freq apt (2) - 45 freq awed (2) - 3 freq awly (2) - 4 freq awo (2) - 1 freq awb (2) - 6 freq appy (2) - 1 freq aur (2) - 1 freq aower (2) - 1 freq awan (2) - 1 freq fawr (2) - 1 freq agp (2) - 1 freq alp (2) - 1 freq |
awpr (0) - 11 freq awar (2) - 4 freq awayr (3) - 1 freq wir (3) - 2249 freq war (3) - 1446 freq iwer (3) - 5 freq wpz (3) - 1 freq appar (3) - 2 freq pawper (3) - 6 freq uapr (3) - 1 freq awery (3) - 1 freq owcr (3) - 1 freq owwr (3) - 1 freq wer (3) - 220 freq pr (3) - 21 freq awner (3) - 4 freq wyr (3) - 5 freq wpa (3) - 1 freq awry (3) - 1 freq ewer (3) - 2 freq aspar (3) - 1 freq owr (3) - 1 freq aware (3) - 61 freq awaar (3) - 20 freq wyper (3) - 1 freq |
SoundEx code - A160 afore - 3480 freq appear - 98 freq afore- - 1 freq affair - 36 freq 'afore - 8 freq afaur - 4 freq afar - 10 freq aiverie - 3 freq afure - 2 freq afoar - 15 freq aubrey - 4 freq a'fore - 2 freq affer - 2 freq aboor - 2 freq afor - 25 freq appar - 2 freq appear' - 1 freq aver - 4 freq aaber - 22 freq afiore - 1 freq afore' - 1 freq afoir - 68 freq affair' - 1 freq afro - 2 freq aiver - 3 freq afoare - 1 freq €˜afore - 2 freq affere - 1 freq aviary - 2 freq afroe - 1 freq avery - 2 freq affeir - 1 freq aferr - 1 freq appeir - 1 freq awpr - 11 freq apirie - 1 freq afer - 1 freq avera - 1 freq |
MetaPhone code - APR appear - 98 freq appar - 2 freq appear' - 1 freq appeir - 1 freq awpr - 11 freq apirie - 1 freq |
AWPR |
Time to execute Levenshtein function - 0.177086 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.336184 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.028130 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.036950 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.000929 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. |