| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeatable (0) - 1 freq relatable (2) - 3 freq reperable (2) - 1 freq respectable (2) - 12 freq reputable (2) - 3 freq respectible (3) - 1 freq regrettable (3) - 1 freq presentable (3) - 3 freq repairable (3) - 1 freq repeatedly (3) - 4 freq repentance (3) - 3 freq repeatitly (3) - 2 freq renewable (3) - 3 freq dependable (3) - 1 freq unbeatable (3) - 2 freq respectably (3) - 1 freq receptacle (3) - 1 freq detectable (3) - 2 freq vegetable (3) - 15 freq remerkable (3) - 4 freq debatable (3) - 1 freq delectable (3) - 1 freq repeatan (3) - 3 freq time-table (4) - 1 freq redoubtable (4) - 1 freq |
repeatable (0) - 1 freq reputable (2) - 3 freq reperable (3) - 1 freq relatable (3) - 3 freq repeatedly (4) - 4 freq repeatitly (4) - 2 freq respectable (4) - 12 freq repairable (4) - 1 freq receptacle (5) - 1 freq vegetable (5) - 15 freq reptile (5) - 1 freq peetiable (5) - 2 freq respectably (5) - 1 freq debatable (5) - 1 freq repeatan (5) - 3 freq unbeatable (5) - 2 freq renewable (5) - 3 freq respectible (5) - 1 freq repeatic (6) - 1 freq creditable (6) - 1 freq resemble (6) - 3 freq payable (6) - 1 freq repete (6) - 1 freq repeople (6) - 3 freq refettle (6) - 1 freq |
SoundEx code - R131 reputable - 3 freq rub-a-dub-dub - 1 freq rooftoaps - 1 freq repeatable - 1 freq ruiftaps - 3 freq ruiftap - 1 freq rooftap - 5 freq ruif-taps - 1 freq rooftops - 2 freq rooftaps - 2 freq rooftopdennis - 1 freq rbtfqu - 1 freq |
MetaPhone code - RPTBL reputable - 3 freq repeatable - 1 freq |
REPEATABLE |
| Time to execute Levenshtein function - 0.195331 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.376191 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.027619 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.042042 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.000949 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. |