| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ascrived (0) - 1 freq ascribed (1) - 2 freq scrived (1) - 3 freq scriped (2) - 1 freq scrieved (2) - 47 freq scriven (2) - 2 freq descrived (2) - 18 freq acrieved (2) - 1 freq inscrived (2) - 1 freq scrive (2) - 1 freq screived (2) - 39 freq scrimed (2) - 2 freq scribed (2) - 1 freq arrived (2) - 140 freq ascribes (2) - 1 freq deprived (3) - 7 freq survived (3) - 37 freq miscried (3) - 1 freq astrid (3) - 82 freq scrieves (3) - 14 freq arrive (3) - 52 freq rived (3) - 20 freq 'strive' (3) - 1 freq uncried (3) - 1 freq acrid (3) - 1 freq |
ascrived (0) - 1 freq scrived (1) - 3 freq screived (2) - 39 freq ascribed (2) - 2 freq scrieved (2) - 47 freq scrive (3) - 1 freq scrimed (3) - 2 freq scribed (3) - 1 freq screeved (3) - 2 freq inscrived (3) - 1 freq scriven (3) - 2 freq scriped (3) - 1 freq acrieved (3) - 1 freq descrived (3) - 18 freq scriever (4) - 60 freq socried (4) - 1 freq scrivened (4) - 1 freq scrowed (4) - 2 freq skreived (4) - 2 freq descreived (4) - 4 freq screiver (4) - 8 freq escheved (4) - 1 freq scraped (4) - 14 freq screwed (4) - 30 freq craved (4) - 3 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 - ASKRFT ascrived - 1 freq |
ASCRIVED |
| Time to execute Levenshtein function - 0.340203 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.587659 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.030474 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.039543 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.000931 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. |