Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
acceptin (0) - 16 freq acceptit (1) - 46 freq acceppin (1) - 3 freq acceptid (1) - 1 freq accepin (1) - 1 freq accepting (1) - 3 freq acceptsna (2) - 1 freq accepit (2) - 2 freq exceptin (2) - 6 freq accepts (2) - 5 freq accessin (2) - 5 freq ceptin (2) - 6 freq acceppit (2) - 12 freq accepte (2) - 1 freq accept (2) - 74 freq accepted (2) - 23 freq avertin (3) - 1 freq actin (3) - 58 freq acceps (3) - 1 freq accessin' (3) - 1 freq abettin (3) - 2 freq certin (3) - 1 freq acettain (3) - 1 freq saucepin (3) - 1 freq accordin (3) - 85 freq |
acceptin (0) - 16 freq acceptit (2) - 46 freq accepting (2) - 3 freq accepin (2) - 1 freq acceptid (2) - 1 freq acceppin (2) - 3 freq accept (3) - 74 freq accepted (3) - 23 freq ceptin (3) - 6 freq accepte (3) - 1 freq acceptsna (3) - 1 freq accepit (3) - 2 freq exceptin (3) - 6 freq accepts (3) - 5 freq acceptance (4) - 30 freq reception (4) - 29 freq occupyin (4) - 2 freq accoontin (4) - 5 freq accountin (4) - 2 freq captin (4) - 2 freq exception (4) - 18 freq acceppit (4) - 12 freq occupation (4) - 14 freq accessin (4) - 5 freq inception (4) - 1 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 - AKSPTN acceptin - 16 freq |
ACCEPTIN |
Time to execute Levenshtein function - 0.200209 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.329297 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.027329 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.036861 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.000880 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. |