| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disagreed (0) - 4 freq disagree (1) - 35 freq disagrees (1) - 3 freq disagreein (2) - 1 freq disagreh (2) - 1 freq disabused (3) - 2 freq desairved (3) - 1 freq distorted (3) - 2 freq dispersed (3) - 4 freq dishairged (3) - 1 freq disturbed (3) - 10 freq disabled (3) - 7 freq discerned (3) - 2 freq discreet (3) - 5 freq disgraced (3) - 3 freq agreed (3) - 106 freq discarded (3) - 2 freq dastreen (4) - 22 freq discharged (4) - 4 freq dialled (4) - 2 freq imagined (4) - 38 freq saired (4) - 7 freq desiree (4) - 1 freq dilated (4) - 1 freq disarm (4) - 1 freq |
disagreed (0) - 4 freq disagrees (2) - 3 freq disagree (2) - 35 freq disagreh (3) - 1 freq disagreein (3) - 1 freq disgraced (4) - 3 freq discaird (5) - 1 freq disfigured (5) - 1 freq desired (5) - 12 freq discard (5) - 1 freq disgrace (5) - 61 freq disguised (5) - 7 freq deserred (5) - 2 freq despaired (5) - 2 freq designed (5) - 34 freq distroyed (5) - 1 freq discord (5) - 5 freq dispersed (5) - 4 freq dishairged (5) - 1 freq distorted (5) - 2 freq desairved (5) - 1 freq disabused (5) - 2 freq disabled (5) - 7 freq disturbed (5) - 10 freq agreed (5) - 106 freq |
SoundEx code - D226 dishwasher - 3 freq disagree - 35 freq disagreement - 3 freq dishwaasher - 1 freq disagreed - 4 freq disagrees - 3 freq disagreein - 1 freq disagreemint - 1 freq desecrated - 1 freq desecrate - 1 freq disagreements - 1 freq dish-waashers - 1 freq desecration - 2 freq disease-ridden - 1 freq dishwashir - 1 freq disagreh - 1 freq |
MetaPhone code - TSKRT discreet - 5 freq disagreed - 4 freq discrete - 3 freq discord - 5 freq desecrate - 1 freq discaird - 1 freq discard - 1 freq |
DISAGREED |
| Time to execute Levenshtein function - 0.267391 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.467860 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.033913 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.041233 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.000939 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. |