Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
active (0) - 33 freq acteive (1) - 1 freq altrive (2) - 1 freq action (2) - 138 freq attie (2) - 3 freq achieve (2) - 35 freq attire (2) - 12 freq scrive (2) - 1 freq argive (2) - 1 freq actis (2) - 1 freq acteeve (2) - 1 freq acting (2) - 12 freq etive (2) - 1 freq captive (2) - 4 freq aleive (2) - 1 freq native (2) - 94 freq activate (2) - 2 freq actively (2) - 14 freq archive (2) - 26 freq chive (2) - 1 freq reactive (2) - 5 freq actin (2) - 58 freq awtie (2) - 1 freq clive (2) - 9 freq actit (2) - 9 freq |
active (0) - 33 freq acteive (1) - 1 freq acteeve (2) - 1 freq activate (3) - 2 freq captive (3) - 4 freq native (3) - 94 freq reactive (3) - 5 freq actit (3) - 9 freq clive (3) - 9 freq actin (3) - 58 freq etive (3) - 1 freq chive (3) - 1 freq actively (3) - 14 freq action (3) - 138 freq achieve (3) - 35 freq actis (3) - 1 freq actioun (4) - 15 freq cruive (4) - 1 freq actor (4) - 19 freq emotive (4) - 3 freq steive (4) - 12 freq stiv (4) - 1 freq chave (4) - 3 freq curve (4) - 24 freq ectit (4) - 1 freq |
SoundEx code - A231 astabillit - 1 freq active - 33 freq activities - 49 freq activists - 32 freq aichty-fower - 1 freq asteep - 2 freq acteevity - 7 freq acteevities - 5 freq agit-prop - 1 freq actively - 14 freq activists' - 1 freq activate - 2 freq acteevitie - 1 freq activities' - 1 freq auchty-fower - 1 freq activity - 30 freq a'wistfil - 1 freq acteivities - 8 freq activist - 12 freq acteivitie - 2 freq acteive - 1 freq actívity - 1 freq activism - 5 freq acteevists - 1 freq activeests - 1 freq acteeve - 1 freq aist-bye - 1 freq axutb - 1 freq aqdp - 1 freq activist - 1 freq aktdf - 1 freq actvities - 1 freq 'activists' - 1 freq activeschoolssa - 1 freq |
MetaPhone code - AKTF active - 33 freq acteive - 1 freq acteeve - 1 freq |
ACTIVE |
Time to execute Levenshtein function - 0.197040 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.335316 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.028237 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.039323 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.001076 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. |