| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moving (0) - 23 freq movin (1) - 124 freq loving (1) - 27 freq movin' (1) - 2 freq ming (2) - 12 freq movin (2) - 1 freq momin (2) - 10 freq 'movin (2) - 1 freq huving (2) - 1 freq going (2) - 234 freq coding (2) - 1 freq hiving (2) - 1 freq bovine (2) - 2 freq moaning (2) - 8 freq losing (2) - 14 freq mowin (2) - 2 freq movan (2) - 10 freq boking (2) - 1 freq mong (2) - 1 freq morin (2) - 2 freq toting (2) - 1 freq raving (2) - 2 freq boeing (2) - 1 freq voting (2) - 27 freq mooin (2) - 4 freq |
moving (0) - 23 freq movin' (2) - 2 freq loving (2) - 27 freq movin (2) - 124 freq raving (3) - 2 freq mavin (3) - 1 freq luving (3) - 1 freq mivin (3) - 1 freq mong (3) - 1 freq mixing (3) - 2 freq having (3) - 59 freq making (3) - 57 freq living (3) - 48 freq mcing (3) - 1 freq movan (3) - 10 freq mining (3) - 5 freq muvin (3) - 12 freq waving (3) - 8 freq huving (3) - 1 freq irving (3) - 1 freq heving (3) - 1 freq ming (3) - 12 freq mating (3) - 1 freq giving (3) - 25 freq saving (3) - 4 freq |
SoundEx code - M152 moving - 23 freq mabinogion - 1 freq mabonslaw - 2 freq map-makar - 1 freq mvmccu - 1 freq mpnxgjebep - 1 freq mibmj - 1 freq moving - 1 freq mbanks - 1 freq muffbeans - 16 freq |
MetaPhone code - MFNK moving - 23 freq moving - 1 freq |
MOVING |
| Time to execute Levenshtein function - 0.341253 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.707171 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.040523 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.089573 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.001063 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. |