| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lisburnreads (0) - 6 freq lisburn (5) - 1 freq missures (6) - 2 freq disturbed (6) - 10 freq little-read (6) - 1 freq burnies (6) - 1 freq lithuanians (6) - 1 freq libertees (6) - 1 freq misures (6) - 9 freq burned (6) - 32 freq spurness (6) - 2 freq burras (6) - 3 freq liberated (6) - 3 freq lissened (6) - 1 freq ivver-ready (6) - 1 freq libbards (6) - 1 freq sunrays (6) - 2 freq unread (6) - 3 freq lawburrows (6) - 14 freq life-threids (6) - 1 freq sunbeds (6) - 6 freq librars (6) - 3 freq listened (6) - 87 freq uisfuness (6) - 1 freq pruifreads (6) - 1 freq |
lisburnreads (0) - 6 freq lisburn (8) - 1 freq bernards (9) - 1 freq librars (9) - 3 freq lawburrows (9) - 14 freq luvburds (9) - 1 freq listeners (9) - 12 freq burners (9) - 7 freq libraries (9) - 27 freq libbards (9) - 1 freq lauborris (10) - 1 freq sourness (10) - 1 freq lawborrowis (10) - 6 freq lawbarrowis (10) - 1 freq lawborrouis (10) - 1 freq spurred (10) - 4 freq burness (10) - 2 freq inroads (10) - 4 freq spreads (10) - 9 freq burnie's (10) - 3 freq lurred (10) - 1 freq liberals (10) - 5 freq spurned (10) - 2 freq burnes (10) - 2 freq larners (10) - 10 freq |
SoundEx code - L216 lug-covers - 2 freq lucifer - 8 freq lochaber - 5 freq 'lochaber - 1 freq lug-piercin - 1 freq low-spirited - 1 freq €˜lochaber - 1 freq lgvrplh - 1 freq lxbrh - 1 freq lisburnreads - 6 freq lewisferguson - 3 freq lockupyergrans - 1 freq lucyprosecco - 99 freq lsfortfkd - 1 freq lsportscoach - 1 freq lisburn - 1 freq lexiprice - 1 freq |
MetaPhone code - LSBRNRTS lisburnreads - 6 freq |
LISBURNREADS |
| Time to execute Levenshtein function - 0.222985 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.383677 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.028304 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.037737 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.000950 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. |