Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
thankin (0) - 5 freq thinkin (1) - 574 freq thakin (1) - 1 freq tankin (1) - 2 freq thanking (1) - 1 freq thankis (1) - 1 freq thankit (1) - 26 freq thenkin (1) - 3 freq thickin (2) - 1 freq thankrif (2) - 2 freq takin (2) - 441 freq changin (2) - 40 freq hankie (2) - 15 freq thinkan (2) - 52 freq crankin (2) - 2 freq hannin (2) - 3 freq chantin (2) - 28 freq twinkin (2) - 1 freq thinken (2) - 2 freq tackin (2) - 1 freq thank (2) - 359 freq tannin (2) - 8 freq 'hinkin (2) - 2 freq shakkin (2) - 83 freq blankin (2) - 1 freq |
thankin (0) - 5 freq thenkin (1) - 3 freq thinkin (1) - 574 freq thinken (2) - 2 freq theinkin (2) - 1 freq thinkan (2) - 52 freq athinkin (2) - 1 freq thinkn (2) - 1 freq thankit (2) - 26 freq tankin (2) - 2 freq thakin (2) - 1 freq thanking (2) - 1 freq thankis (2) - 1 freq whinkin (3) - 1 freq thinkin' (3) - 22 freq hunkin (3) - 1 freq theinken (3) - 6 freq tinkin (3) - 57 freq thinnin (3) - 1 freq thanked (3) - 28 freq tunkin (3) - 1 freq thankfu (3) - 9 freq thankt (3) - 1 freq thanks (3) - 451 freq honkin (3) - 27 freq |
SoundEx code - T525 thinkin - 574 freq thinking - 85 freq think--an - 1 freq thankin - 5 freq tension - 32 freq thinkna - 1 freq tamson's - 19 freq thomson - 26 freq thinggyin - 1 freq tin-canned - 1 freq tamson - 32 freq thinkan - 52 freq thamesmooth - 1 freq thingman - 2 freq thinkin' - 22 freq thingumay - 1 freq thanking - 1 freq theinken - 6 freq thinken - 2 freq thenkin - 3 freq theinkin - 1 freq tomsin - 2 freq timaagine - 1 freq time-consumein - 1 freq tamsons' - 1 freq tensions - 3 freq tankin - 2 freq thïnkin - 7 freq tinkin - 57 freq tennyson - 1 freq tunkin - 1 freq thingmy - 3 freq tamasin - 1 freq tamsons - 2 freq tamason - 2 freq tensjin - 1 freq thingymabab - 1 freq thingymababs - 1 freq thoonsans - 1 freq thomson' - 1 freq toonsman - 1 freq tinkeen - 1 freq tammasmas - 1 freq thanksgien - 1 freq twangin - 2 freq th'auncient - 1 freq thanksgiein - 1 freq tonguing - 1 freq thamson - 1 freq thamsons - 1 freq tensiouns - 1 freq tinking - 1 freq tanganyika - 1 freq €˜twanging - 1 freq twanging - 1 freq townsend - 1 freq tangental - 1 freq thingummy - 1 freq twinkin - 1 freq tensin - 1 freq thomasina - 5 freq thomson's - 1 freq thomasengst - 1 freq thomasm - 5 freq thingmajig - 1 freq theoncoming - 1 freq thmkn - 1 freq thomsonnn - 1 freq tomkins - 1 freq tomjohn - 1 freq thinkn - 1 freq timeschanged - 1 freq thingmie - 1 freq thing-umy-jig - 1 freq thinkin-bunnet - 1 freq tmxoomw - 1 freq tamsonÂ’s - 1 freq tiomgsckn - 1 freq tomcampbell - 1 freq tengmalm's - 1 freq tumshiem - 2 freq thingumyjigg - 1 freq tanzymc - 1 freq thomsonx - 1 freq tomasmbosch - 2 freq tinkan - 1 freq |
MetaPhone code - 0NKN thinkin - 574 freq think--an - 1 freq thankin - 5 freq thinkna - 1 freq thinkan - 52 freq thinkin' - 22 freq theinken - 6 freq thinken - 2 freq thenkin - 3 freq theinkin - 1 freq thïnkin - 7 freq thinkn - 1 freq |
THANKIN thank - 359 freq thanks - 451 freq ta - 2534 freq thankfae - 1 freq thankryfe - 2 freq thankfu - 9 freq thanksgiving - 3 freq thankless - 6 freq thankin - 5 freq thanking - 1 freq thankful - 11 freq thankit - 26 freq thankfully - 26 freq thanked - 28 freq |
Time to execute Levenshtein function - 0.210878 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.357022 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.027177 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.037265 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.000891 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. |