| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| awakenin (0) - 2 freq awakening (1) - 1 freq awaukenin (1) - 3 freq wakenin (1) - 2 freq swackenin (2) - 1 freq awaken (2) - 1 freq weakenin (2) - 2 freq awakened (2) - 1 freq wakening (2) - 2 freq wakkenin (2) - 2 freq awakenings (2) - 1 freq waukenin (2) - 7 freq waakenin (2) - 2 freq awake (3) - 31 freq waakenan (3) - 1 freq wanin (3) - 2 freq daurkenin (3) - 3 freq wauknin (3) - 1 freq awaitin (3) - 6 freq awkin (3) - 2 freq aakin (3) - 3 freq alamein (3) - 1 freq wairnin (3) - 7 freq awoken (3) - 2 freq akamkevin (3) - 1 freq |
awakenin (0) - 2 freq wakenin (1) - 2 freq awaukenin (1) - 3 freq waukenin (2) - 7 freq weakenin (2) - 2 freq waakenin (2) - 2 freq awakening (2) - 1 freq wauknin (3) - 1 freq awakened (3) - 1 freq awaken (3) - 1 freq wakkenin (3) - 2 freq wakening (3) - 2 freq waakenan (3) - 1 freq wakin (4) - 20 freq wikein (4) - 2 freq awaukent (4) - 2 freq wakened (4) - 9 freq likenin (4) - 2 freq warnin (4) - 92 freq kaenin (4) - 2 freq widenin (4) - 9 freq wakent (4) - 5 freq awnin (4) - 20 freq waarnin (4) - 4 freq waken (4) - 9 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - AWKNN awaukenin - 3 freq awakenin - 2 freq |
AWAKENIN |
| Time to execute Levenshtein function - 0.261241 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.383274 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.028661 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.043212 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.001126 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. |