| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tinker (0) - 21 freq tinder (1) - 8 freq tanker (1) - 4 freq stinker (1) - 1 freq thinker (1) - 4 freq tinkers (1) - 4 freq jinker (1) - 2 freq sinker (1) - 1 freq linker (1) - 1 freq ticker (1) - 3 freq minker (1) - 2 freq tinner (1) - 1 freq tinkler (1) - 2 freq ainger (2) - 3 freq sicker (2) - 8 freq tike (2) - 2 freq wisker (2) - 1 freq tinkie (2) - 5 freq ringer (2) - 6 freq tenner (2) - 25 freq tipper (2) - 14 freq hanker (2) - 3 freq tankers (2) - 2 freq unker (2) - 4 freq ginger (2) - 113 freq |
tinker (0) - 21 freq tanker (1) - 4 freq linker (2) - 1 freq minker (2) - 2 freq tinkler (2) - 2 freq sinker (2) - 1 freq tinner (2) - 1 freq ticker (2) - 3 freq jinker (2) - 2 freq tinder (2) - 8 freq stinker (2) - 1 freq thinker (2) - 4 freq tinkers (2) - 4 freq tinkle (3) - 4 freq lineker (3) - 1 freq conker (3) - 1 freq talker (3) - 3 freq tink (3) - 195 freq tinkte (3) - 1 freq toker (3) - 1 freq teaker (3) - 1 freq tanner (3) - 10 freq toner (3) - 1 freq hunker (3) - 12 freq bunker (3) - 22 freq |
SoundEx code - T526 teenager - 20 freq tinkerman - 1 freq tinker - 21 freq tonsured - 2 freq tinkering - 1 freq teenagers - 10 freq tinker's - 2 freq tanker - 4 freq toonser - 7 freq tanker-mouthed - 1 freq teenaiger - 1 freq toonsers - 6 freq tinkers - 4 freq tankard - 1 freq tangerine - 12 freq thinker - 4 freq thinkers - 5 freq tangerines - 5 freq tenzers - 1 freq tankers - 2 freq thankrife - 1 freq thankrif - 2 freq teenaijurs - 1 freq thankryfe - 2 freq tankart - 1 freq tinkerbell - 2 freq time-series - 1 freq tinkerin - 1 freq twnywxqrqe - 1 freq tnzsyrbsbq - 1 freq themajorityscot - 3 freq tonkerthomas - 3 freq tyneeskwriters - 1 freq tomsker - 1 freq tmusrjiio - 1 freq tonycarroll - 1 freq |
MetaPhone code - TNKR tinker - 21 freq tanker - 4 freq dunnicaer - 1 freq doon-cry - 1 freq donegore - 3 freq |
TINKER |
| Time to execute Levenshtein function - 0.176810 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.314787 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.027404 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.037002 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.000825 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. |