| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| decisively (0) - 1 freq derisively (1) - 1 freq decisive' (2) - 1 freq definsively (2) - 1 freq decisive (2) - 3 freq deceptively (3) - 1 freq defensively (3) - 1 freq negitively (3) - 1 freq evasively (3) - 2 freq devisive (3) - 2 freq definitely (3) - 117 freq negatively (4) - 2 freq deceive (4) - 7 freq dismissively (4) - 4 freq deisil (4) - 1 freq deceived (4) - 2 freq decibels (4) - 1 freq definsive (4) - 1 freq passively (4) - 2 freq secretively (4) - 1 freq exclusively (4) - 3 freq massively (4) - 3 freq decision (4) - 86 freq ecisweel (4) - 1 freq relatively (4) - 7 freq |
decisively (0) - 1 freq derisively (2) - 1 freq decisive (3) - 3 freq decisive' (3) - 1 freq definsively (4) - 1 freq evasively (5) - 2 freq devisive (5) - 2 freq deceptively (5) - 1 freq defensively (5) - 1 freq decidetly (6) - 1 freq decision' (6) - 1 freq decision (6) - 86 freq massively (6) - 3 freq actively (6) - 14 freq deceiver (6) - 2 freq exclusively (6) - 3 freq decidedly (6) - 8 freq decisions (6) - 29 freq divisive (6) - 7 freq dcesil (6) - 1 freq ecisweel (6) - 1 freq deceived (6) - 2 freq definitely (6) - 117 freq negitively (6) - 1 freq deisil (6) - 1 freq |
SoundEx code - D221 decisively - 1 freq decisive' - 1 freq decisive - 3 freq djokovic - 1 freq dqhcprp - 1 freq dssuuqypd - 1 freq djokovic's - 2 freq dxwszab - 1 freq djixf - 1 freq dqkhxwabm - 1 freq digiscoped - 1 freq dwqgajsbbx - 1 freq dicegoblin - 1 freq |
MetaPhone code - TSSFL decisively - 1 freq |
DECISIVELY |
| Time to execute Levenshtein function - 0.334633 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.496301 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.039917 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.042718 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.001013 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. |