| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dïffrent (0) - 1 freq diffrent (2) - 17 freq dïffrence (2) - 2 freq dífferent (2) - 1 freq diffrint (3) - 3 freq diffren (3) - 1 freq different (3) - 741 freq deefferent (3) - 2 freq deeferent (3) - 4 freq diffrmnt (3) - 1 freq deifferent (3) - 11 freq deiferent (3) - 5 freq deiffrint (3) - 1 freq diff'rent (3) - 3 freq dif'rent (3) - 1 freq dïstrict (4) - 3 freq differint (4) - 24 freq diffrence (4) - 10 freq stiffent (4) - 1 freq differunt (4) - 1 freq deterrent (4) - 3 freq degerent (4) - 1 freq affront (4) - 32 freq referent (4) - 3 freq differen (4) - 1 freq |
dïffrent (0) - 1 freq dïffrence (3) - 2 freq dífferent (3) - 1 freq diffrent (4) - 17 freq deefferent (5) - 2 freq deifferent (5) - 11 freq different (5) - 741 freq diffrint (5) - 3 freq deiffrint (5) - 1 freq diff'rent (6) - 3 freq dif'rent (6) - 1 freq differint (6) - 24 freq diffrmnt (6) - 1 freq deeferent (6) - 4 freq deiferent (6) - 5 freq differunt (6) - 1 freq diffren (6) - 1 freq differen (7) - 1 freq affront (7) - 32 freq dïstrict (7) - 3 freq diffrence (7) - 10 freq differin' (8) - 1 freq differin (8) - 6 freq differently (8) - 16 freq differn (8) - 1 freq |
SoundEx code - D165 difference - 143 freq different - 741 freq differences - 34 freq differently - 16 freq doverin - 15 freq devoorin - 2 freq deformities - 1 freq differen - 1 freq deveron - 1 freq diff'rence - 2 freq diffrence - 10 freq diff'rent - 3 freq devourin - 6 freq deveronside - 1 freq differint - 24 freq differinces - 1 freq differince - 3 freq diffrent - 17 freq differin - 6 freq diffrint - 3 freq deefferent - 2 freq dïffrence - 2 freq dïffrent - 1 freq dif'rent - 1 freq differiny - 1 freq differentiated - 1 freq deifferand - 8 freq deifferin - 1 freq doavrin - 1 freq differin' - 1 freq deiffrint - 1 freq deiferences - 1 freq deiferent - 5 freq deiference - 1 freq diffrmnt - 1 freq deeferent - 4 freq deifferent - 11 freq differentiation - 4 freq dyperin - 1 freq deference - 4 freq differing - 2 freq deeference - 1 freq different - 1 freq doberman - 2 freq dífferent - 1 freq deifferences - 1 freq differential - 1 freq differance - 2 freq differunt - 1 freq different - 1 freq deformed - 1 freq differn - 1 freq diffren - 1 freq diffrences - 1 freq differentiate - 1 freq deform - 1 freq deborahmeaden - 2 freq differin - 1 freq dfrntdrmmr - 1 freq defreend - 1 freq |
MetaPhone code - TFRNT different - 741 freq diff'rent - 3 freq differint - 24 freq diffrent - 17 freq diffrint - 3 freq deefferent - 2 freq dïffrent - 1 freq dif'rent - 1 freq deifferand - 8 freq deiffrint - 1 freq deiferent - 5 freq deeferent - 4 freq deifferent - 11 freq different - 1 freq dífferent - 1 freq differunt - 1 freq different - 1 freq defreend - 1 freq |
DÏFFRENT |
| Time to execute Levenshtein function - 0.296452 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.522210 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.031828 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.043229 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.000968 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. |