| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ajfter (0) - 1 freq aifter (1) - 343 freq aefter (1) - 4 freq after (1) - 354 freq ajer (2) - 2 freq aftir (2) - 1 freq aftur (2) - 1 freq afer (2) - 1 freq awfte (2) - 1 freq atter (2) - 1 freq aidter (2) - 1 freq efter (2) - 3150 freq afte (2) - 1 freq nifter (2) - 2 freq softer (2) - 4 freq aftner (2) - 1 freq aunter (2) - 2 freq aister (2) - 2 freq aeter (2) - 1 freq rafter (2) - 1 freq alter (2) - 15 freq ameter (2) - 1 freq aster (2) - 1 freq safter (2) - 10 freq aalter (2) - 1 freq |
ajfter (0) - 1 freq aefter (2) - 4 freq after (2) - 354 freq aifter (2) - 343 freq softer (3) - 4 freq nifter (3) - 2 freq jater (3) - 1 freq aiftir (3) - 1 freq efter (3) - 3150 freq ifter (3) - 1 freq eifter (3) - 3 freq dafter (3) - 6 freq aftur (3) - 1 freq aftir (3) - 1 freq lafter (3) - 1 freq 'efter (3) - 5 freq safter (3) - 10 freq rafter (3) - 1 freq fayter (4) - 1 freq anter (4) - 1 freq fiter (4) - 1 freq aften (4) - 345 freq eftyr (4) - 1 freq fouter (4) - 6 freq eftir (4) - 500 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 freq acceptable - 25 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 - AJFTR ajfter - 1 freq |
AJFTER |
| Time to execute Levenshtein function - 0.169449 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.318092 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.031799 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.037289 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. |