| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tullaghans (0) - 2 freq dollaghan (3) - 1 freq callaghan (3) - 6 freq tulachan (3) - 1 freq mullagh (4) - 1 freq laaghan (4) - 1 freq tulchan (4) - 1 freq clachans (4) - 30 freq ullans (4) - 32 freq cullykhan (4) - 1 freq mullachs (4) - 1 freq killagan (4) - 4 freq laggans (4) - 1 freq gollachs (5) - 3 freq tartans (5) - 4 freq shullans (5) - 1 freq milligan (5) - 4 freq flagrant (5) - 1 freq €œlallans (5) - 2 freq mollachin (5) - 1 freq villains (5) - 3 freq gollachin (5) - 1 freq pillaging (5) - 1 freq €˜lallans (5) - 4 freq llamas (5) - 1 freq |
tullaghans (0) - 2 freq callaghan (5) - 6 freq dollaghan (5) - 1 freq tulachan (6) - 1 freq alleghenies (7) - 1 freq killagan (7) - 4 freq tallahassee (7) - 1 freq mullachs (7) - 1 freq tellins (7) - 5 freq tillyphone (7) - 2 freq laggans (7) - 1 freq cullykhan (7) - 1 freq mullagh (7) - 1 freq laaghan (7) - 1 freq tulchan (7) - 1 freq clachans (7) - 30 freq ullans (7) - 32 freq villagers (8) - 5 freq tullys (8) - 3 freq callyshang (8) - 1 freq lashins (8) - 3 freq laaghin (8) - 1 freq laaghs (8) - 3 freq bulletins (8) - 2 freq throu-hans (8) - 4 freq |
SoundEx code - T425 talkin - 380 freq talking - 56 freq telecommunications - 1 freq talkin-tae - 1 freq toilsome - 1 freq talkin' - 6 freq talismans - 1 freq talk'n - 1 freq tullaghans - 2 freq 'talkin - 1 freq talikn - 1 freq tolkien - 3 freq toliken's - 1 freq talkan - 18 freq tail-waggin - 1 freq tholesomely - 1 freq tholesomeness - 1 freq talikan - 1 freq talking' - 1 freq theologian - 1 freq tulchan - 1 freq €œtalkin - 1 freq talcum - 1 freq €™talkin - 1 freq tolquhongallery - 1 freq tolquhon - 1 freq talkingsense - 1 freq tlcmq - 1 freq tulachan - 1 freq |
MetaPhone code - TLFNS dolphins - 7 freq tullaghans - 2 freq telephones - 1 freq |
TULLAGHANS |
| Time to execute Levenshtein function - 0.230352 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.385802 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.030530 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.050819 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.001209 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. |