| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| levelled (0) - 4 freq labelled (2) - 13 freq levellt (2) - 1 freq trevelled (2) - 6 freq levellin (2) - 5 freq revealed (2) - 13 freq shevelled (2) - 1 freq devalled (2) - 1 freq levered (2) - 3 freq rebelled (2) - 1 freq jewelled (2) - 5 freq luvelie (3) - 3 freq leeted (3) - 1 freq levied (3) - 1 freq devellin (3) - 1 freq keilled (3) - 2 freq revellers (3) - 1 freq swelled (3) - 8 freq telled (3) - 2 freq velued (3) - 2 freq develue (3) - 1 freq bevellers (3) - 1 freq evolved (3) - 9 freq lulled (3) - 3 freq modelled (3) - 1 freq |
levelled (0) - 4 freq devalled (3) - 1 freq levellin (3) - 5 freq labelled (3) - 13 freq levellt (3) - 1 freq lavell (4) - 2 freq raivelled (4) - 7 freq jewelled (4) - 5 freq lovell (4) - 1 freq lulled (4) - 3 freq shevelled (4) - 1 freq revealed (4) - 13 freq trevelled (4) - 6 freq rebelled (4) - 1 freq levered (4) - 3 freq gelled (5) - 1 freq devolved (5) - 7 freq revolved (5) - 1 freq shelled (5) - 2 freq towelled (5) - 1 freq recalled (5) - 1 freq ealled (5) - 1 freq ecalled (5) - 1 freq devalved (5) - 1 freq leeved (5) - 55 freq |
SoundEx code - L143 lea-field - 1 freq levelled - 4 freq liability - 5 freq labelled - 13 freq leaflets - 10 freq leafletin - 3 freq luvvult - 1 freq leaflet - 11 freq labelt - 2 freq levelt - 1 freq livelihoods - 2 freq label't - 2 freq labellt - 1 freq l'evolution - 1 freq level-heiditness - 1 freq levellt - 1 freq livelihood - 1 freq labellit - 1 freq love-letter - 1 freq leafleting - 1 freq |
MetaPhone code - LFLT lea-field - 1 freq levelled - 4 freq luvvult - 1 freq leaflet - 11 freq levelt - 1 freq levellt - 1 freq |
LEVELLED |
| Time to execute Levenshtein function - 0.260231 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.364755 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.028141 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.037986 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. |