Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
typewriter (0) - 5 freq ayewrite (3) - 2 freq kypewatter (3) - 1 freq copywriter (3) - 1 freq kypewater (3) - 1 freq terrier (4) - 13 freq nawewriters (4) - 1 freq territor (4) - 5 freq writer (4) - 65 freq hypocrite (4) - 4 freq twiter (4) - 1 freq weewrite (4) - 3 freq hypocrites (4) - 9 freq pewter (4) - 3 freq peerier (4) - 17 freq rewrite (4) - 2 freq penrith (5) - 1 freq greiter (5) - 1 freq heritor (5) - 1 freq €œawrite (5) - 1 freq rosewatter (5) - 1 freq speirit's (5) - 3 freq the-gither (5) - 6 freq yester (5) - 4 freq editer (5) - 1 freq |
typewriter (0) - 5 freq copywriter (4) - 1 freq kypewatter (5) - 1 freq kypewater (5) - 1 freq writer (6) - 65 freq twiter (6) - 1 freq territor (6) - 5 freq pewter (6) - 3 freq ayewrite (6) - 2 freq temperatur (7) - 1 freq thorter (7) - 2 freq supporter (7) - 21 freq porter (7) - 13 freq torter (7) - 1 freq operator (7) - 5 freq tipster (7) - 1 freq tapert (7) - 2 freq territury (7) - 1 freq twitter (7) - 178 freq tapewirm (7) - 1 freq reporter (7) - 23 freq twatter (7) - 7 freq territour (7) - 4 freq territory (7) - 26 freq twuster (7) - 4 freq |
SoundEx code - T163 tea-pairty - 4 freq tea-perty - 1 freq tea-party - 3 freq tippertaed - 1 freq tapert - 2 freq typewriter - 5 freq tay-pairty - 1 freq taypairty - 1 freq tayport - 2 freq tae-pairty - 2 freq tobered - 1 freq tapered - 2 freq taivert - 2 freq taiver't - 1 freq taivert-lke - 1 freq tap-root - 1 freq twa-pairt - 1 freq tippertaes - 1 freq tippered - 1 freq tuiberdrola - 1 freq thebridge - 1 freq theforthbridges - 4 freq tbrwood - 1 freq |
MetaPhone code - TPRTR depairture - 2 freq departure - 8 freq typewriter - 5 freq |
TYPEWRITER |
Time to execute Levenshtein function - 0.193039 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.355055 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.027309 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.036812 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.000803 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. |