| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edfringe (0) - 17 freq fringe (2) - 36 freq during (3) - 54 freq syringe (3) - 5 freq dring (3) - 1 freq editing (3) - 3 freq wringe (3) - 1 freq cringe (3) - 33 freq enduring (3) - 1 freq 'fringe' (3) - 1 freq fridge (3) - 59 freq fringed (3) - 1 freq earrings (3) - 7 freq fringes (3) - 2 freq dorine (3) - 2 freq daring (3) - 1 freq stringe (3) - 16 freq adoring (3) - 1 freq prince (4) - 346 freq fingle (4) - 1 freq finger (4) - 193 freq frunce (4) - 1 freq defince (4) - 2 freq ending (4) - 17 freq frie (4) - 18 freq |
edfringe (0) - 17 freq fringe (3) - 36 freq daring (4) - 1 freq adoring (4) - 1 freq dring (4) - 1 freq during (4) - 54 freq offering (5) - 8 freq stringe (5) - 16 freq frieng (5) - 1 freq drongo (5) - 2 freq firing (5) - 3 freq drying (5) - 6 freq admiring (5) - 2 freq drainage (5) - 3 freq frying (5) - 2 freq editing (5) - 3 freq fringed (5) - 1 freq syringe (5) - 5 freq wringe (5) - 1 freq dorine (5) - 2 freq fridge (5) - 59 freq fringes (5) - 2 freq enduring (5) - 1 freq cringe (5) - 33 freq 'fringe' (5) - 1 freq |
SoundEx code - E316 edvard - 2 freq edfringe - 17 freq edburghcaleyfc - 7 freq |
MetaPhone code - ETFRNJ edfringe - 17 freq |
EDFRINGE |
| Time to execute Levenshtein function - 0.210419 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.340728 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.027524 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.040418 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.000855 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. |