| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ascribed (0) - 2 freq ascrived (1) - 1 freq ascribes (1) - 1 freq scribed (1) - 1 freq inscribed (2) - 4 freq ascribin (2) - 1 freq scribes (2) - 7 freq scrimed (2) - 2 freq scrived (2) - 3 freq described (2) - 33 freq scriped (2) - 1 freq scribe (2) - 7 freq scripted (3) - 2 freq absorbed (3) - 4 freq screived (3) - 39 freq socried (3) - 1 freq scrubbed (3) - 6 freq asseired (3) - 1 freq describes (3) - 19 freq archied (3) - 1 freq afcred (3) - 3 freq accaised (3) - 1 freq crined (3) - 7 freq accuized (3) - 2 freq scribbled (3) - 13 freq |
ascribed (0) - 2 freq scribed (1) - 1 freq ascribes (2) - 1 freq ascrived (2) - 1 freq scriped (3) - 1 freq scribe (3) - 7 freq scrived (3) - 3 freq described (3) - 33 freq scrimed (3) - 2 freq ascribin (3) - 1 freq inscribed (3) - 4 freq scribes (3) - 7 freq scrowed (4) - 2 freq scriba (4) - 1 freq scruifed (4) - 1 freq scraped (4) - 14 freq scrabbed (4) - 3 freq scabbed (4) - 2 freq escribir (4) - 2 freq screwed (4) - 30 freq scrybe (4) - 2 freq screed (4) - 32 freq screived (4) - 39 freq socried (4) - 1 freq scrubbed (4) - 6 freq |
SoundEx code - A261 agreeable - 3 freq acarpous - 1 freq ascribed - 2 freq aggravatin' - 1 freq acrieved - 1 freq aggrieved - 4 freq acrobat - 3 freq ascribin - 1 freq awgroups - 1 freq aggravatit - 1 freq acrobats - 1 freq ageravatit - 1 freq age-reversal - 5 freq agrouf - 2 freq ascrived - 1 freq aggrievit - 1 freq aggreivance - 1 freq acrobatics - 3 freq ascribes - 1 freq acerbic - 1 freq aqua-aerobics - 4 freq acorruptedpoet - 1 freq aczrpctari - 3 freq acrophobia - 1 freq |
MetaPhone code - ASKRBT ascribed - 2 freq |
ASCRIBED |
| Time to execute Levenshtein function - 0.349043 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.569191 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.078629 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.038054 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.000986 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. |