Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tint-pegs (0) - 1 freq hin-legs (3) - 2 freq linties (4) - 3 freq hin-leg (4) - 1 freq tentless (4) - 7 freq titties (4) - 1 freq tinkies (4) - 2 freq titles (4) - 13 freq winnipeg (4) - 1 freq minties (4) - 10 freq hint-end (4) - 2 freq tiptaes (4) - 3 freq tiptoes (4) - 3 freq tines (4) - 7 freq tints (4) - 3 freq tittie's (4) - 2 freq tentiness (4) - 1 freq interess (4) - 5 freq tingles (4) - 1 freq titnes (4) - 1 freq hint-ends (4) - 1 freq tings (4) - 23 freq tippets (4) - 1 freq tinysteps (4) - 3 freq mint-merks (4) - 1 freq |
tint-pegs (0) - 1 freq hin-legs (6) - 2 freq hint-ends (7) - 1 freq tentiness (7) - 1 freq tints (7) - 3 freq tings (7) - 23 freq tentles (7) - 2 freq lang-legs (7) - 1 freq guinea-pigs (7) - 19 freq pint-cans (7) - 1 freq tinysteps (7) - 3 freq tentless (7) - 7 freq geeny-pigs (7) - 2 freq taints (8) - 1 freq hin-laigs (8) - 1 freq guineapigs (8) - 1 freq pent-pot (8) - 1 freq tent-like (8) - 1 freq that-wis (8) - 1 freq peat-bogs (8) - 1 freq nutmegs (8) - 1 freq line-ups (8) - 1 freq tung-p (8) - 2 freq bentaps (8) - 1 freq gun-dogs (8) - 1 freq |
SoundEx code - T531 twenty-fower - 3 freq twinty-fower - 11 freq twenty-five - 11 freq twinty-five - 8 freq twinty-four - 1 freq timetable - 13 freq twenty-first - 3 freq twenty-four-carrot - 1 freq twenty-four - 7 freq tentfu - 1 freq tint-pegs - 1 freq toonty-fowr - 2 freq twunty-fower - 2 freq timetable's - 1 freq twenty-four-seven - 1 freq twinty-fower-year-auld - 1 freq tim'table - 8 freq tentfoul - 1 freq twentyfour - 1 freq twantie-furst - 1 freq twinty-first - 4 freq twinty-fifteen - 1 freq twenty-fowr - 1 freq twentyfower - 1 freq twintyfive - 1 freq tentive - 1 freq time-table - 1 freq themattevers - 20 freq timothyferres - 1 freq |
MetaPhone code - TNTPKS tint-pegs - 1 freq |
TINT-PEGS |
Time to execute Levenshtein function - 0.204041 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.383836 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.029048 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.038695 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.000930 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. |