Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
assailant (0) - 1 freq assistant (3) - 19 freq assail (3) - 7 freq saicant (3) - 7 freq assaultet (3) - 2 freq skailan (3) - 1 freq assault (3) - 14 freq sailan (3) - 5 freq assint (3) - 1 freq assails (3) - 2 freq assaultit (3) - 1 freq a-sailin (3) - 1 freq assailed (3) - 2 freq atalanta (4) - 41 freq appairent (4) - 1 freq assassins (4) - 2 freq braisant (4) - 1 freq assistit (4) - 1 freq assynt (4) - 4 freq asklent (4) - 8 freq assaulted (4) - 3 freq astabillit (4) - 1 freq associat (4) - 1 freq fassiont (4) - 1 freq saicint (4) - 7 freq |
assailant (0) - 1 freq assault (4) - 14 freq assint (4) - 1 freq assaultit (4) - 1 freq assaultet (4) - 2 freq asklent (5) - 8 freq seilent (5) - 6 freq asclent (5) - 1 freq ssolaht (5) - 1 freq resiliant (5) - 1 freq silent (5) - 144 freq slant (5) - 3 freq assasinate (5) - 1 freq assynt (5) - 4 freq assent (5) - 2 freq assignit (5) - 1 freq assailed (5) - 2 freq a-sailin (5) - 1 freq saicant (5) - 7 freq sailan (5) - 5 freq assails (5) - 2 freq assistant (5) - 19 freq assail (5) - 7 freq skailan (5) - 1 freq sealan (6) - 1 freq |
SoundEx code - A245 asclent - 1 freq acclamation - 2 freq asklent - 8 freq aisling - 1 freq acclaimit - 2 freq a-glowin - 1 freq auckland - 3 freq asklenty - 1 freq agglan - 1 freq a-sailin - 1 freq asylum - 13 freq acclaim - 3 freq asylum-seekin - 1 freq assailant - 1 freq agcolehamilton - 7 freq achillin - 1 freq |
MetaPhone code - ASLNT assailant - 1 freq |
ASSAILANT |
Time to execute Levenshtein function - 0.235061 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.442736 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.027547 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.045987 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.001220 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. |