| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tibetan (0) - 40 freq tibetans (1) - 1 freq 'tibetan (1) - 1 freq tiltan (2) - 1 freq tibet (2) - 10 freq titan (2) - 5 freq tiftan (2) - 1 freq tinman (3) - 1 freq tean (3) - 1 freq diean (3) - 1 freq sicecan (3) - 1 freq tittin (3) - 2 freq tip-tap (3) - 3 freq sieman (3) - 1 freq trottan (3) - 2 freq eitan (3) - 1 freq fittan (3) - 1 freq pieman (3) - 4 freq ribena (3) - 2 freq tiptae (3) - 6 freq tiberias (3) - 1 freq tairtan (3) - 2 freq siftan (3) - 1 freq fichtan (3) - 1 freq meetan (3) - 6 freq |
tibetan (0) - 40 freq 'tibetan (2) - 1 freq tibetans (2) - 1 freq titan (3) - 5 freq tiftan (3) - 1 freq tibet (3) - 10 freq tiltan (3) - 1 freq titian (4) - 1 freq baetan (4) - 1 freq bitan (4) - 1 freq traetin (4) - 1 freq tostan (4) - 1 freq tiltin (4) - 6 freq tintin (4) - 7 freq ubtan (4) - 1 freq tweetin (4) - 20 freq tairtan (4) - 2 freq tistin (4) - 1 freq beatan (4) - 3 freq tertan (4) - 1 freq testan (4) - 1 freq tuttan (4) - 1 freq tittin (4) - 2 freq orbitan (4) - 2 freq tartan (4) - 93 freq |
SoundEx code - T135 tap-o-the-milk - 1 freq tippy-toeing - 1 freq tibetan - 40 freq the-bottom - 1 freq tiftan - 1 freq tiptoing - 1 freq tiptoein - 1 freq tapdoon - 1 freq 'tibetan - 1 freq tibetans - 1 freq tfdmp - 1 freq |
MetaPhone code - TBTN tibetan - 40 freq debaiten - 1 freq deebaiten - 1 freq debatin - 3 freq debatin' - 1 freq doubtin - 3 freq 'tibetan - 1 freq doubtin' - 1 freq |
TIBETAN |
| Time to execute Levenshtein function - 0.229817 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.394714 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.031914 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.042681 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.000897 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. |