| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| law-plea (0) - 2 freq low-pey (3) - 2 freq nae-pea (3) - 1 freq aiples (4) - 4 freq laxdale (4) - 1 freq awhile (4) - 15 freq ladfleg (4) - 20 freq lawyer (4) - 33 freq by-pley (4) - 1 freq labelled (4) - 13 freq pawper (4) - 6 freq maple (4) - 6 freq law-lyin (4) - 1 freq lowped (4) - 64 freq sample (4) - 20 freq aipples (4) - 91 freq rampled (4) - 1 freq jaw-hole (4) - 3 freq a-lee (4) - 3 freq lapel (4) - 3 freq dapple (4) - 2 freq pappled (4) - 2 freq azalea (4) - 2 freq lamped (4) - 2 freq lawer (4) - 10 freq |
law-plea (0) - 2 freq low-pey (4) - 2 freq low-pay (5) - 1 freq lawfully (6) - 3 freq lapel (6) - 3 freq lowped (6) - 64 freq by-pley (6) - 1 freq law-lyin (6) - 1 freq flag-pole (6) - 1 freq nae-pea (6) - 1 freq lawful (6) - 3 freq jaw-hole (6) - 3 freq warple (6) - 1 freq pawkle (7) - 1 freq lawvies (7) - 1 freq lwp (7) - 1 freq cample (7) - 5 freq lawies (7) - 1 freq lowpt (7) - 23 freq lag-en (7) - 2 freq lawlier (7) - 1 freq tawpie (7) - 1 freq tax-plan (7) - 1 freq low-tax (7) - 1 freq wheeple (7) - 2 freq |
SoundEx code - L140 label - 57 freq lovely - 165 freq level - 148 freq lively - 10 freq law-plea - 2 freq lawfully - 3 freq lawful - 3 freq luvely - 9 freq luvelie - 3 freq luvlee - 2 freq laybil - 2 freq luvuly - 1 freq luvulee - 1 freq lapel - 3 freq livvel - 2 freq luv'ly - 1 freq liable - 4 freq 'lovely - 1 freq luvly - 5 freq laevil - 1 freq lavell - 2 freq leafully - 1 freq lovel - 1 freq lvl - 1 freq lovell - 1 freq loaf'll - 1 freq luffly - 3 freq luvvly - 1 freq llvl - 1 freq |
MetaPhone code - LPL law-plea - 2 freq lapel - 3 freq |
LAW-PLEA |
| Time to execute Levenshtein function - 0.264251 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.424017 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.028193 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.042279 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.000920 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. |