| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kittybrewster (0) - 1 freq brewster (5) - 3 freq brewsters (6) - 1 freq kirbister (6) - 1 freq brewstar (6) - 2 freq fittabeseen (6) - 1 freq kist-drawer (6) - 1 freq interested (6) - 58 freq kypewater (6) - 1 freq browster (6) - 1 freq intherested (6) - 1 freq interestet (6) - 6 freq bitterest (6) - 1 freq nittenstar (6) - 15 freq interestid (7) - 2 freq bowster (7) - 12 freq distresst (7) - 2 freq kittlet (7) - 5 freq fitbabanter (7) - 1 freq pittabreid (7) - 1 freq kittiwake (7) - 3 freq shewster (7) - 2 freq typewriter (7) - 5 freq fifty-fower (7) - 1 freq yivo-bletter (7) - 1 freq |
kittybrewster (0) - 1 freq brewster (8) - 3 freq browster (9) - 1 freq brewstar (9) - 2 freq brewsters (10) - 1 freq bitterest (10) - 1 freq nittenstar (10) - 15 freq kirbister (10) - 1 freq timbermaister (11) - 1 freq westerbister (11) - 1 freq blowster (11) - 1 freq brewstars (11) - 1 freq pettawater (11) - 1 freq bowster (11) - 12 freq ghettoblaster (11) - 1 freq browser (11) - 4 freq kypewater (11) - 1 freq interested (11) - 58 freq kist-drawer (11) - 1 freq fittabeseen (11) - 1 freq intherested (11) - 1 freq interestet (11) - 6 freq westmeenster (12) - 11 freq kittles (12) - 7 freq wintonbrewery (12) - 9 freq |
SoundEx code - K316 kittybrewster - 1 freq katieprice - 1 freq kateforbes - 2 freq kateforbesmsp - 1 freq kateferguson - 1 freq kdvfwrypz - 1 freq keithbrownsnp - 2 freq keithburgess - 5 freq |
MetaPhone code - KTBRSTR kittybrewster - 1 freq |
KITTYBREWSTER |
| Time to execute Levenshtein function - 0.240445 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.396203 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.027649 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.040064 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.000929 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. |