| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| repeyment (0) - 1 freq peyment (2) - 6 freq repellent (2) - 1 freq mevement (3) - 1 freq element (3) - 45 freq regiment (3) - 21 freq reteirment (3) - 1 freq represent (3) - 29 freq referent (3) - 3 freq peymint (3) - 1 freq payment (3) - 4 freq dependent (3) - 5 freq repent (3) - 17 freq repeyed (3) - 2 freq repeatet (3) - 6 freq greement (3) - 20 freq deployment (3) - 1 freq peyments (3) - 5 freq reprent (3) - 2 freq repentant (3) - 3 freq resentment (3) - 7 freq tenement (3) - 21 freq reverent (3) - 3 freq implyment (3) - 4 freq remeent (3) - 2 freq |
repeyment (0) - 1 freq peyment (3) - 6 freq repent (4) - 17 freq remeent (4) - 2 freq reprent (4) - 2 freq peymint (4) - 1 freq payment (4) - 4 freq regiment (4) - 21 freq repellent (4) - 1 freq raiment (5) - 2 freq argyment (5) - 2 freq implyment (5) - 4 freq repint (5) - 3 freq remant (5) - 1 freq paument (5) - 1 freq argiement (5) - 25 freq rolment (5) - 1 freq tenement (5) - 21 freq airgyment (5) - 6 freq ornyment (5) - 1 freq reverent (5) - 3 freq element (5) - 45 freq reteirment (5) - 1 freq referent (5) - 3 freq represent (5) - 29 freq |
SoundEx code - R155 repeyment - 1 freq refinement - 3 freq ripenin - 5 freq reponin - 2 freq ravenin - 1 freq refinin - 2 freq reponents - 1 freq ruifmemmers - 1 freq rpmmomthvo - 1 freq rivening - 1 freq robbiemenzies - 8 freq |
MetaPhone code - RPMNT repeyment - 1 freq |
REPEYMENT |
| Time to execute Levenshtein function - 0.371717 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.579978 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.031384 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.084457 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.000888 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. |