| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tubular (0) - 2 freq jugular (2) - 2 freq tobar (3) - 2 freq muscular (3) - 8 freq ocular (3) - 1 freq tullay (3) - 1 freq tabulet (3) - 1 freq tumult (3) - 2 freq tushkar (3) - 3 freq modular (3) - 1 freq tummlan (3) - 1 freq pullar (3) - 5 freq tummler (3) - 3 freq tumults (3) - 1 freq tuba (3) - 1 freq bobblar (3) - 1 freq tibur (3) - 2 freq bulgar (3) - 1 freq teecular (3) - 1 freq angular (3) - 1 freq insular (3) - 4 freq uvulars (3) - 1 freq sub-par (3) - 1 freq regular (3) - 75 freq burglar (3) - 3 freq |
tubular (0) - 2 freq tibur (4) - 2 freq tuber (4) - 1 freq tumbler (4) - 4 freq tabulet (4) - 1 freq teecular (4) - 1 freq jugular (4) - 2 freq tobar (4) - 2 freq table' (5) - 1 freq tables (5) - 84 freq blare (5) - 3 freq balr (5) - 1 freq tailor (5) - 28 freq tablet (5) - 25 freq taylor (5) - 17 freq doubler (5) - 6 freq tlr (5) - 1 freq taller (5) - 24 freq cobler (5) - 1 freq taaler (5) - 3 freq taaller (5) - 1 freq tebel (5) - 1 freq tbl (5) - 1 freq tytler (5) - 1 freq tiber (5) - 1 freq |
SoundEx code - T146 tap-fleer - 1 freq toblerone - 1 freq tubular - 2 freq tapaleerie - 1 freq |
MetaPhone code - TBLR tubular - 2 freq doubler - 6 freq doobler - 1 freq |
TUBULAR |
| Time to execute Levenshtein function - 0.405645 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.574976 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.029236 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.044025 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.001248 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. |