Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
assessments (0) - 4 freq assessment (1) - 21 freq plaessments (3) - 2 freq assinments (3) - 1 freq vestments (4) - 1 freq sediments (4) - 1 freq assignment (4) - 4 freq assistants (4) - 3 freq aisement (4) - 2 freq assortment (4) - 2 freq assessin' (4) - 1 freq agiements (4) - 1 freq amenments (4) - 1 freq amusements (4) - 1 freq assassins (4) - 2 freq assessit (4) - 1 freq plaessment (4) - 1 freq adjustments (4) - 1 freq assessed (4) - 6 freq agreements (4) - 2 freq assessin (4) - 4 freq segments (4) - 2 freq ameesement (4) - 2 freq possessionis (5) - 1 freq presidents (5) - 6 freq |
assessments (0) - 4 freq assessment (2) - 21 freq assinments (5) - 1 freq plaessments (5) - 2 freq assistants (6) - 3 freq assassins (6) - 2 freq plaessment (7) - 1 freq assessit (7) - 1 freq segments (7) - 2 freq amusements (7) - 1 freq assessin (7) - 4 freq assassinate (7) - 1 freq adjustments (7) - 1 freq vestments (7) - 1 freq assignment (7) - 4 freq sediments (7) - 1 freq assortment (7) - 2 freq assessin' (7) - 1 freq debasements (8) - 1 freq dissydents (8) - 4 freq assists (8) - 1 freq sentiments (8) - 8 freq assassinatit (8) - 1 freq assassin (8) - 2 freq instriments (8) - 1 freq |
SoundEx code - A225 accusin - 7 freq aisy-gaun - 1 freq assignations - 1 freq assessin - 4 freq ashkenazi - 1 freq assignment - 4 freq assigned - 6 freq accusing - 3 freq assassination - 5 freq accessin - 5 freq assessment - 21 freq assessments - 4 freq assignit - 1 freq assessin' - 1 freq accessin' - 1 freq assassins - 2 freq a-seekin - 1 freq assassinatit - 1 freq accusingly - 1 freq assassin - 2 freq assassinations - 2 freq accusinly - 1 freq acquiescence - 2 freq assassinate - 1 freq acasayanymare - 1 freq ashashoneill - 1 freq assasinate - 1 freq |
MetaPhone code - ASSMNTS assessments - 4 freq |
ASSESSMENTS |
Time to execute Levenshtein function - 0.217744 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.372377 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.029752 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.036814 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.000808 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. |