| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tubin (0) - 1 freq tubing (1) - 1 freq tunin (1) - 10 freq tuin (1) - 27 freq tubie (1) - 1 freq wuin (2) - 3 freq dumbin (2) - 2 freq tuil (2) - 3 freq tursin (2) - 1 freq tube (2) - 46 freq curin (2) - 5 freq dybin (2) - 1 freq thain (2) - 6 freq t'fin (2) - 1 freq robin (2) - 196 freq tubey (2) - 1 freq yulin (2) - 1 freq 'bin (2) - 1 freq pubic (2) - 1 freq tain (2) - 42 freq ebbin (2) - 3 freq tubs (2) - 5 freq buyin (2) - 84 freq fumin (2) - 8 freq t'bie (2) - 1 freq |
tubin (0) - 1 freq tuin (2) - 27 freq tubie (2) - 1 freq tunin (2) - 10 freq tubing (2) - 1 freq turn (3) - 793 freq oobin (3) - 2 freq trein (3) - 1 freq tubby (3) - 1 freq towin (3) - 1 freq toyin (3) - 2 freq tubes (3) - 20 freq tirin (3) - 4 freq tuber (3) - 1 freq timin (3) - 6 freq tein (3) - 3 freq tin (3) - 180 freq tuimin (3) - 2 freq texin (3) - 1 freq cabin (3) - 20 freq abin (3) - 43 freq toin (3) - 1 freq teein (3) - 2 freq twein (3) - 1 freq tynin (3) - 20 freq |
SoundEx code - T150 thievin - 16 freq tippm - 1 freq tovin - 8 freq tappin - 20 freq theivin - 3 freq two-penny - 1 freq tubin - 1 freq thavm - 4 freq tippin - 4 freq tyauvin - 18 freq typin - 14 freq tyavin - 2 freq teapin - 1 freq typin' - 1 freq toppen - 1 freq twa-pun - 1 freq tappan - 3 freq t'fin - 1 freq theevin - 1 freq tyaavin - 2 freq tuppeny - 1 freq tiefen - 2 freq tippenny - 4 freq theophanie - 1 freq toppin - 4 freq tippeen - 1 freq tyavvin - 1 freq taviani - 2 freq tapin' - 1 freq teyauvin - 1 freq twapenny - 1 freq tiefin - 3 freq tappin' - 2 freq tap-en - 1 freq tvnn - 1 freq tfmmuh - 1 freq tyvm - 1 freq typhoon - 1 freq |
MetaPhone code - TBN dabbin - 7 freq tubin - 1 freq 'dobbin' - 1 freq dobbin - 13 freq dybin - 1 freq dubbin - 1 freq dbn - 1 freq |
TUBIN |
| Time to execute Levenshtein function - 0.234115 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.364493 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.027465 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.047887 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.001133 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. |