| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twirl (0) - 5 freq swirl (1) - 16 freq tirl (1) - 14 freq twirls (1) - 1 freq twurl (1) - 1 freq thirl (1) - 3 freq twill (1) - 1 freq dirl (2) - 45 freq twigs (2) - 12 freq swirls (2) - 7 freq wirm (2) - 17 freq twist (2) - 45 freq 'wir (2) - 7 freq taitl (2) - 1 freq twice (2) - 183 freq wil (2) - 12 freq twerp (2) - 1 freq tir (2) - 4 freq thir (2) - 1508 freq wir (2) - 2162 freq twall (2) - 3 freq tirn (2) - 35 freq tuil (2) - 3 freq swirlt (2) - 2 freq twins (2) - 57 freq |
twirl (0) - 5 freq twurl (1) - 1 freq twill (2) - 1 freq thirl (2) - 3 freq tirl (2) - 14 freq swirl (2) - 16 freq twirls (2) - 1 freq twirled (3) - 2 freq worl (3) - 35 freq swirly (3) - 2 freq twaal (3) - 6 freq twar (3) - 2 freq warl (3) - 164 freq twall (3) - 3 freq swurl (3) - 4 freq twal (3) - 120 freq thirle (3) - 2 freq twirlin (3) - 5 freq wurl (3) - 1 freq twaul (3) - 2 freq twerp (3) - 1 freq trial (3) - 82 freq twel (3) - 1 freq wirld (4) - 73 freq pairl (4) - 3 freq |
SoundEx code - T640 there'll - 63 freq terrile - 1 freq terrel - 6 freq thirl - 3 freq trulie - 4 freq trial - 82 freq trail - 57 freq thirle - 2 freq traal - 1 freq truly - 124 freq thare'll - 2 freq traill - 2 freq thur'll - 3 freq trawl - 3 freq trolley - 27 freq thor'll - 1 freq tirl - 14 freq throuly - 1 freq troll - 11 freq truelie - 2 freq trail' - 1 freq twurl - 1 freq thir'll - 5 freq thair'il - 2 freq thrial - 1 freq thair'll - 13 freq thrill - 18 freq 'there'll - 1 freq twaa-year-aul - 2 freq thrall - 4 freq trill - 3 freq trolly - 1 freq truil - 1 freq twirl - 5 freq tryall - 1 freq three-wheel - 1 freq trowel - 1 freq therell - 1 freq truely - 1 freq terrell - 4 freq |
MetaPhone code - TWRL twurl - 1 freq twirl - 5 freq |
TWIRL |
| Time to execute Levenshtein function - 0.299720 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.536275 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.059981 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.037234 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.000817 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. |