| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tetror (0) - 1 freq terror (1) - 39 freq terrors (2) - 3 freq error (2) - 16 freq meteor (2) - 1 freq terr (2) - 8 freq tetris (2) - 1 freq tenor (2) - 4 freq terrour (2) - 1 freq tenior (2) - 1 freq petrol (2) - 30 freq metro (2) - 3 freq tutor (2) - 9 freq retro (2) - 8 freq tether (2) - 18 freq tedder (3) - 2 freq metres (3) - 15 freq wetter (3) - 4 freq tenors (3) - 1 freq fether (3) - 23 freq teeter (3) - 1 freq terms (3) - 133 freq perr (3) - 23 freq meirour (3) - 1 freq tempo (3) - 4 freq |
tetror (0) - 1 freq terror (2) - 39 freq terrour (3) - 1 freq tetris (3) - 1 freq tether (3) - 18 freq tutor (3) - 9 freq terr (3) - 8 freq tutree (4) - 1 freq tatrp (4) - 1 freq totter (4) - 2 freq steurer (4) - 1 freq tutors (4) - 5 freq titter (4) - 1 freq itecrr (4) - 1 freq terra (4) - 1 freq etter (4) - 2 freq terrie (4) - 2 freq steerer (4) - 2 freq tither (4) - 202 freq totier (4) - 1 freq terrier (4) - 13 freq tytler (4) - 1 freq turr (4) - 1 freq terry (4) - 16 freq ttruq (4) - 1 freq |
SoundEx code - T366 tetror - 1 freq tetrarch - 6 freq thedrawer - 1 freq |
MetaPhone code - TTRR tetror - 1 freq |
TETROR |
| Time to execute Levenshtein function - 0.275777 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.563861 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.028065 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.037580 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.000850 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. |