| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aspidistra (0) - 1 freq sidit (5) - 1 freq administer (5) - 1 freq aspiret (5) - 1 freq assisted (5) - 1 freq spikit (5) - 2 freq spiritit (5) - 1 freq distrak (5) - 1 freq 'spirited (5) - 1 freq fadista (5) - 1 freq spirit's (5) - 5 freq spinster (5) - 4 freq assiduity (5) - 1 freq 'spider' (5) - 2 freq amidst (5) - 6 freq spider (5) - 30 freq spirity (5) - 1 freq saadist (5) - 2 freq asides (5) - 8 freq assistit (5) - 1 freq 'spirit (5) - 1 freq spirited (5) - 1 freq assists (5) - 1 freq impidint (5) - 1 freq annidir (5) - 1 freq |
aspidistra (0) - 1 freq sophistry (6) - 1 freq spinster (6) - 4 freq spider (7) - 30 freq saadist (7) - 2 freq sidestep (7) - 1 freq seinister (7) - 3 freq pedester (7) - 1 freq spinsters (7) - 2 freq sadist (7) - 2 freq sequestra (7) - 1 freq sinister (7) - 10 freq spidery (7) - 1 freq padster (7) - 1 freq pedestrian (8) - 5 freq sistir (8) - 1 freq assistin (8) - 2 freq ministry (8) - 4 freq saadust (8) - 3 freq splinter (8) - 4 freq spectre (8) - 4 freq spiritual (8) - 11 freq rapidity (8) - 1 freq sawdust (8) - 25 freq sponsor (8) - 3 freq |
SoundEx code - A213 accept - 74 freq acceptance - 30 freq accepts - 5 freq acceptin - 16 freq accepted - 23 freq acceptable - 24 freq accepit - 2 freq acceptit - 46 freq acceptabilty - 1 freq accepting - 3 freq achieved - 14 freq aspidistra - 1 freq asphodel - 1 freq accepte - 1 freq acceppit - 12 freq acceptilautioun - 1 freq aquavit - 1 freq acceptability - 1 freq acceptid - 1 freq acceptsna - 1 freq ajfter - 1 freq assipattle - 5 freq assipattle's - 1 freq aspd - 1 freq agiftaday - 4 freq aqua-fit - 1 freq aqbudsuu - 1 freq |
MetaPhone code - ASPTSTR aspidistra - 1 freq |
ASPIDISTRA |
| Time to execute Levenshtein function - 0.243034 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.416756 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.029107 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.041084 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.000868 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. |