Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tethert (0) - 3 freq fethert (1) - 1 freq gethert (1) - 41 freq tether (1) - 18 freq tithers (2) - 1 freq wuthert (2) - 7 freq fether' (2) - 1 freq techers (2) - 1 freq aether (2) - 1 freq blethert (2) - 6 freq jethart (2) - 6 freq withert (2) - 4 freq bithert (2) - 2 freq tther (2) - 6 freq lettert (2) - 8 freq nithert (2) - 2 freq gathert (2) - 3 freq gethers (2) - 11 freq gether (2) - 42 freq rether (2) - 53 freq weathert (2) - 1 freq teddert (2) - 2 freq ether (2) - 27 freq tethered (2) - 12 freq tother (2) - 1 freq |
tethert (0) - 3 freq fethert (2) - 1 freq tether (2) - 18 freq gethert (2) - 41 freq tither (3) - 202 freq mithert (3) - 1 freq dithert (3) - 1 freq tethered (3) - 12 freq githert (3) - 3 freq tother (3) - 1 freq gethirt (3) - 1 freq leathert (3) - 1 freq bathert (3) - 11 freq weathert (3) - 1 freq tattert (3) - 4 freq tittert (3) - 1 freq bothert (3) - 37 freq bithert (3) - 2 freq tther (3) - 6 freq withert (3) - 4 freq jethart (3) - 6 freq tithers (3) - 1 freq nithert (3) - 2 freq wuthert (3) - 7 freq gathert (3) - 3 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 - T0RT tethered - 12 freq dithert - 1 freq tethert - 3 freq taethurd - 1 freq |
TETHERT |
Time to execute Levenshtein function - 0.207298 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.356810 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.027748 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.042959 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.002199 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. |