| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| taiblet (0) - 3 freq tablet (1) - 23 freq taislet (1) - 2 freq taible (1) - 2 freq taiglet (1) - 1 freq tabulet (2) - 1 freq toilet (2) - 91 freq table (2) - 674 freq tacklet (2) - 1 freq taigles (2) - 4 freq table' (2) - 1 freq tabled (2) - 1 freq taikle (2) - 1 freq tanglet (2) - 1 freq tarbet (2) - 1 freq tairget (2) - 10 freq tablets (2) - 7 freq taiglit (2) - 2 freq paibles (2) - 1 freq paidlet (2) - 1 freq tables (2) - 83 freq taeble (2) - 3 freq taisled (2) - 1 freq titlet (2) - 1 freq taiglt (2) - 2 freq |
taiblet (0) - 3 freq tablet (1) - 23 freq taiglet (2) - 1 freq tabulet (2) - 1 freq taislet (2) - 2 freq taible (2) - 2 freq taeble (3) - 3 freq tables (3) - 83 freq taiglit (3) - 2 freq titlet (3) - 1 freq taibit (3) - 1 freq tablets (3) - 7 freq taebles (3) - 2 freq taiglt (3) - 2 freq tibet (3) - 10 freq table (3) - 674 freq table' (3) - 1 freq toilet (3) - 91 freq tabled (3) - 1 freq taigilt (4) - 2 freq daibelt (4) - 1 freq tirlit (4) - 2 freq twilt (4) - 2 freq tumblt (4) - 2 freq tilt (4) - 30 freq |
SoundEx code - T143 tableheid - 1 freq toppled - 3 freq tablets - 7 freq taiblet - 3 freq tablet - 23 freq table-tap - 1 freq tablet-waal - 1 freq tablet-waaleh - 1 freq tabloids - 6 freq tabloid - 3 freq twafauld - 4 freq twa-fauld - 1 freq twafaald - 2 freq tabulet - 1 freq tabletap - 1 freq tabled - 1 freq twofold - 1 freq twafald - 1 freq tea-blaudit - 1 freq tbltalkmedia - 1 freq tablet's - 1 freq two-fold - 1 freq theboldtype - 1 freq |
MetaPhone code - TBLT taiblet - 3 freq doubled - 7 freq tablet - 23 freq dabbled - 1 freq tabloid - 3 freq doobled - 4 freq doublt - 2 freq dibbled - 1 freq tabulet - 1 freq debility - 1 freq daibelt - 1 freq dooblet - 2 freq doobelt - 1 freq tabled - 1 freq |
TAIBLET |
| Time to execute Levenshtein function - 0.223336 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.357644 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.027555 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.037024 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.000782 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. |