Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
taigelt (0) - 12 freq taigilt (1) - 2 freq taegelt (1) - 1 freq taiglt (1) - 2 freq tangelt (1) - 2 freq taiselt (1) - 1 freq draigelt (2) - 2 freq taigil (2) - 2 freq taigle (2) - 10 freq taggert (2) - 1 freq target (2) - 33 freq haimelt (2) - 5 freq aizelt (2) - 1 freq taiglet (2) - 1 freq untaigelt (2) - 3 freq jangelt (2) - 1 freq tairget (2) - 10 freq waggelt (2) - 1 freq taivert (2) - 2 freq tanglt (2) - 1 freq langelt (2) - 1 freq traivelt (2) - 22 freq taiglit (2) - 2 freq daibelt (2) - 1 freq raivelt (2) - 20 freq |
taigelt (0) - 12 freq taiglt (1) - 2 freq taegelt (1) - 1 freq taigilt (1) - 2 freq taiglet (2) - 1 freq taiglit (2) - 2 freq taiselt (2) - 1 freq tangelt (2) - 2 freq tanglt (3) - 1 freq taigle (3) - 10 freq untaigelt (3) - 3 freq taigil (3) - 2 freq taislet (4) - 2 freq toilet (4) - 91 freq gelt (4) - 1 freq taught (4) - 66 freq tiggit (4) - 2 freq trelt (4) - 1 freq telt (4) - 1538 freq trailt (4) - 7 freq teelt (4) - 1 freq twilt (4) - 2 freq taigled (4) - 3 freq taiblet (4) - 3 freq taigles (4) - 4 freq |
SoundEx code - T243 taigelt - 12 freq taislet - 2 freq taigilt - 2 freq tagliatelle - 2 freq taiglt - 2 freq ticklit - 1 freq taigled - 3 freq tickled - 8 freq tackled - 1 freq tousled - 1 freq taegelt - 1 freq taisled - 1 freq tjaldur - 1 freq taiselt - 1 freq toosled - 2 freq taiglit - 2 freq tusseled - 1 freq touseled - 1 freq teckled - 1 freq touslt - 2 freq tousilt - 1 freq touzelt - 1 freq taiglet - 1 freq tacklet - 1 freq touslet - 1 freq tooslet - 1 freq theslidedown - 5 freq thesltn - 2 freq tickledpink - 1 freq |
MetaPhone code - TJLT taigelt - 12 freq taigilt - 2 freq taegelt - 1 freq |
TAIGELT |
Time to execute Levenshtein function - 0.194936 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.390606 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.029937 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.037672 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.000875 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. |