| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| enraptured (0) - 1 freq enrapturin (2) - 1 freq naptured (2) - 1 freq ruptured (3) - 1 freq rapture (3) - 1 freq fractured (3) - 6 freq unrantered (3) - 1 freq riptured (3) - 8 freq enamoured (3) - 1 freq natured (3) - 2 freq captured (3) - 30 freq recaptured (3) - 3 freq endangered (4) - 6 freq capture (4) - 22 freq endeavoured (4) - 2 freq scripture (4) - 15 freq raptur (4) - 3 freq eraiturs (4) - 1 freq capaured (4) - 1 freq craturd (4) - 1 freq natures (4) - 3 freq featured (4) - 9 freq structured (4) - 3 freq scriptures (4) - 11 freq captures (4) - 3 freq |
enraptured (0) - 1 freq naptured (3) - 1 freq enrapturin (3) - 1 freq riptured (4) - 8 freq ruptured (4) - 1 freq unrantered (4) - 1 freq nurtured (5) - 5 freq natured (5) - 2 freq captured (5) - 30 freq recaptured (5) - 3 freq fractured (5) - 6 freq rapture (5) - 1 freq riptures (6) - 13 freq indentured (6) - 1 freq tortured (6) - 19 freq cratered (6) - 1 freq caiptured (6) - 1 freq ripture (6) - 2 freq entered (6) - 40 freq captered (6) - 1 freq rappered (6) - 1 freq naitered (6) - 1 freq nattered (6) - 1 freq erupted (6) - 8 freq craturd (6) - 1 freq |
SoundEx code - E561 enraptured - 1 freq enrapturin - 1 freq emmaharpermsp - 32 freq |
MetaPhone code - ENRPTRT enraptured - 1 freq |
ENRAPTURED |
| Time to execute Levenshtein function - 0.203356 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.404436 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.029305 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.037481 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.000887 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. |