| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tuilkit (0) - 2 freq quilkit (1) - 2 freq trickit (2) - 26 freq buildit (2) - 1 freq milkit (2) - 5 freq til'it (2) - 1 freq cuikit (2) - 2 freq tuilzie (2) - 5 freq sulkit (2) - 3 freq tuilyie (2) - 2 freq tiltit (2) - 7 freq tuilie (2) - 1 freq juikit (2) - 1 freq tinkit (2) - 1 freq tuckit (2) - 10 freq talkit (2) - 2 freq luikit (2) - 132 freq tickit (2) - 3 freq tuimit (2) - 3 freq duckit (3) - 1 freq steikit (3) - 22 freq tickie (3) - 1 freq mairkit (3) - 4 freq maikit (3) - 1 freq trackit (3) - 1 freq |
tuilkit (0) - 2 freq quilkit (2) - 2 freq talkit (2) - 2 freq luikit (3) - 132 freq tuckit (3) - 10 freq talkt (3) - 1 freq tiltit (3) - 7 freq tickit (3) - 3 freq tinkit (3) - 1 freq til'it (3) - 1 freq milkit (3) - 5 freq sulkit (3) - 3 freq ticket (4) - 170 freq luikt (4) - 49 freq walkit (4) - 37 freq traikit (4) - 2 freq luekit (4) - 2 freq waalkit (4) - 3 freq trokit (4) - 4 freq til't (4) - 40 freq theekit (4) - 2 freq tltit (4) - 1 freq tiltet (4) - 1 freq telit (4) - 1 freq theikit (4) - 6 freq |
SoundEx code - T423 talkit - 2 freq talked - 51 freq tealight - 1 freq talkt - 1 freq tallest - 6 freq twilight - 9 freq tullahought - 1 freq twaluggit - 1 freq tail-light - 1 freq tea-lichts - 1 freq tillicoutry - 2 freq talkative - 2 freq toolshed - 1 freq tail-lights - 1 freq tailgate - 1 freq thilicht - 1 freq tuilkit - 2 freq thelastleg - 1 freq talktotheduck - 1 freq tlscadden - 1 freq th'lectric - 1 freq |
MetaPhone code - TLKT talkit - 2 freq dialect - 262 freq talked - 51 freq delicate - 21 freq delegate - 3 freq talkt - 1 freq delicat - 5 freq dialect' - 2 freq dilicat - 1 freq delict - 1 freq €˜dialect - 20 freq tailgate - 1 freq tuilkit - 2 freq daiälekt - 4 freq |
TUILKIT |
| Time to execute Levenshtein function - 0.184950 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.418209 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.035850 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.037167 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.000839 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. |