| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teddirt (0) - 1 freq teddert (1) - 2 freq jeddart (2) - 2 freq beddit (2) - 16 freq eddir (2) - 10 freq eddir' (2) - 1 freq tiddir (2) - 1 freq neddir (2) - 3 freq geddert (2) - 1 freq feddit (2) - 1 freq reddit (2) - 13 freq teddies (2) - 2 freq heddir (2) - 4 freq tedders (2) - 1 freq heddit (2) - 1 freq steddit (2) - 1 freq tedder (2) - 2 freq reddir (2) - 6 freq tendit (2) - 19 freq reddins (3) - 1 freq eedikt (3) - 1 freq paddit (3) - 2 freq reddina (3) - 1 freq seairt (3) - 1 freq bendit (3) - 2 freq |
teddirt (0) - 1 freq teddert (1) - 2 freq geddert (3) - 1 freq tiddir (3) - 1 freq tedders (3) - 1 freq tedder (3) - 2 freq jeddart (3) - 2 freq laddert (4) - 1 freq eddir' (4) - 1 freq tendit (4) - 19 freq unteddert (4) - 1 freq reddir (4) - 6 freq tidder (4) - 50 freq tedderin (4) - 1 freq toddlt (4) - 2 freq stoddart (4) - 4 freq reddit (4) - 13 freq neddir (4) - 3 freq feddit (4) - 1 freq teddies (4) - 2 freq heddir (4) - 4 freq steddit (4) - 1 freq heddit (4) - 1 freq beddit (4) - 16 freq eddir (4) - 10 freq |
SoundEx code - T363 tethered - 12 freq tittert - 1 freq tattered - 7 freq tethert - 3 freq tattered-lookin - 1 freq teetered - 3 freq tottered - 3 freq tattert - 4 freq tootered - 2 freq teddirt - 1 freq tetrahedrons - 1 freq 'totey-rote' - 1 freq teddert - 2 freq twittert - 1 freq taethurd - 1 freq tittered - 1 freq twa-thirds - 1 freq tooteroooed - 3 freq thatweeredhead - 11 freq thetruthaboutyoursandwich - 1 freq |
MetaPhone code - TTRT tittert - 1 freq detoured - 2 freq doitert - 1 freq tattered - 7 freq deterred - 3 freq teetered - 3 freq dottert - 1 freq tottered - 3 freq tattert - 4 freq tootered - 2 freq teddirt - 1 freq 'totey-rote' - 1 freq teddert - 2 freq dytered - 1 freq duddered - 2 freq tittered - 1 freq detroit - 21 freq tooteroooed - 3 freq |
TEDDIRT |
| Time to execute Levenshtein function - 0.411103 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.674533 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.028771 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.072639 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.001129 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. |