| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onexpekkit (0) - 1 freq unexpeckit (2) - 10 freq expekkit (2) - 5 freq oonexpeckit (2) - 2 freq neglekkit (3) - 1 freq unexpectit (3) - 9 freq expeckit (3) - 31 freq onsnekkit (3) - 1 freq uxexpeckit (3) - 1 freq expecit (4) - 2 freq ootrekkit (4) - 1 freq onlukkit (4) - 1 freq expectit (4) - 34 freq negleckit (4) - 3 freq snekkit (4) - 4 freq one-leggit (4) - 1 freq erekkit (4) - 2 freq expeckin (4) - 21 freq connekkit (4) - 1 freq respeckit (4) - 15 freq onlokkit (4) - 1 freq reflekkit (4) - 3 freq expecktit (4) - 1 freq henpeckit (4) - 1 freq onhankit (5) - 2 freq |
onexpekkit (0) - 1 freq oonexpeckit (3) - 2 freq expekkit (3) - 5 freq unexpeckit (3) - 10 freq uxexpeckit (5) - 1 freq expeckit (5) - 31 freq onsnekkit (5) - 1 freq unexpectit (5) - 9 freq neglekkit (5) - 1 freq onlukkit (6) - 1 freq onlokkit (6) - 1 freq pokkit (7) - 1 freq unpackit (7) - 1 freq reflekkit (7) - 3 freq henpeckit (7) - 1 freq nyakkit (7) - 2 freq unexpeckitlie (7) - 2 freq spikkit (7) - 1 freq pikkit (7) - 1 freq unpikit (7) - 1 freq expecktit (7) - 1 freq snekkit (7) - 4 freq negleckit (7) - 3 freq ootrekkit (7) - 1 freq erekkit (7) - 2 freq |
SoundEx code - O521 oonexpeckit - 2 freq onicbodie - 1 freq oncuivert - 1 freq onciveilitie - 1 freq on-spoken - 1 freq onexpekkit - 1 freq onceover - 1 freq omzfjvwq - 1 freq onceuponashire - 7 freq omuyjbr - 1 freq onkypzp - 1 freq |
MetaPhone code - ONKSPKT oonexpeckit - 2 freq onexpekkit - 1 freq |
ONEXPEKKIT |
| Time to execute Levenshtein function - 0.218953 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.365593 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.028234 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.038827 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.001139 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. |