| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twalmonth (0) - 8 freq twal-month (1) - 2 freq twalmont (1) - 1 freq twalmond (2) - 5 freq twalfth (3) - 6 freq twalth (3) - 1 freq salmon (4) - 46 freq twa-foot (4) - 1 freq wamth (4) - 1 freq twelfth (4) - 11 freq waltons (4) - 1 freq twonty (4) - 1 freq aalmost (4) - 1 freq twalfths (4) - 1 freq tolbooth (4) - 14 freq almonds (4) - 2 freq almond (4) - 4 freq i'month (4) - 1 freq talbot (4) - 4 freq walloch (4) - 1 freq waements (4) - 1 freq lamont (4) - 8 freq twaalth (4) - 1 freq month (4) - 330 freq millionth (4) - 3 freq |
twalmonth (0) - 8 freq twalmont (2) - 1 freq twal-month (2) - 2 freq twalmond (4) - 5 freq twalth (5) - 1 freq twalfth (5) - 6 freq twelth (6) - 1 freq twaalth (6) - 1 freq twelfth (6) - 11 freq -month (7) - 1 freq twalt (7) - 2 freq billionth (7) - 1 freq twantieth (7) - 1 freq twanty (7) - 3 freq walketh (7) - 1 freq samanth (7) - 1 freq talent (7) - 59 freq wament (7) - 1 freq belmont (7) - 6 freq waments (7) - 1 freq walmart (7) - 1 freq tollbooth (7) - 2 freq 'month (7) - 1 freq warmth (7) - 58 freq talents (7) - 13 freq |
SoundEx code - T455 twalmond - 5 freq twal-nuin - 1 freq twalmonth - 8 freq twal-month - 2 freq tullimentan - 4 freq twalmont - 1 freq toulmin- - 1 freq |
MetaPhone code - TWLMN0 twalmonth - 8 freq twal-month - 2 freq |
TWALMONTH |
| Time to execute Levenshtein function - 0.216892 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.355237 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.027260 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.039337 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.001127 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. |