| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peculiar (0) - 7 freq peculiarly (2) - 1 freq secular (2) - 3 freq cullar (3) - 1 freq jocular (3) - 1 freq peruvian (3) - 1 freq cecilia (3) - 2 freq declir (3) - 1 freq ocular (3) - 1 freq teecular (3) - 1 freq popular (3) - 100 freq pullar (3) - 5 freq auxuliar (3) - 1 freq regular (3) - 75 freq petunia (3) - 3 freq pedlar (3) - 3 freq pelao (4) - 1 freq paulin' (4) - 1 freq occupier (4) - 1 freq peching (4) - 1 freq peir (4) - 3 freq circular (4) - 8 freq tubular (4) - 2 freq pochlin (4) - 1 freq pectae (4) - 1 freq |
peculiar (0) - 7 freq peculiarly (3) - 1 freq secular (3) - 3 freq teecular (4) - 1 freq pullar (4) - 5 freq ocular (4) - 1 freq pedlar (4) - 3 freq popular (4) - 100 freq declir (4) - 1 freq jocular (4) - 1 freq parucular (5) - 1 freq declare (5) - 25 freq peecial (5) - 1 freq puller (5) - 1 freq clear (5) - 492 freq culur (5) - 3 freq preclare (5) - 2 freq culor (5) - 1 freq 'clear (5) - 1 freq poplar (5) - 1 freq nuclear (5) - 32 freq pictir (5) - 19 freq pecr (5) - 1 freq pecker (5) - 1 freq polar (5) - 24 freq |
SoundEx code - P246 pauchler - 1 freq peculiarities' - 1 freq peculiarities - 1 freq puzzler - 1 freq peculiar - 7 freq pauchlers - 1 freq peculiarly - 1 freq pauchleris - 1 freq |
MetaPhone code - PKLR peculiar - 7 freq |
PECULIAR |
| Time to execute Levenshtein function - 0.219278 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.343944 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.028421 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.038780 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.000897 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. |