| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| layer (0) - 13 freq lawer (1) - 10 freq lawyer (1) - 33 freq layed (1) - 16 freq layert (1) - 2 freq later (1) - 550 freq layers (1) - 20 freq mayer (1) - 1 freq player (1) - 116 freq payer (1) - 1 freq laser (1) - 4 freq laer (1) - 1 freq layen (1) - 2 freq fayer (1) - 3 freq lager (1) - 38 freq laayer (1) - 5 freq loser (2) - 4 freq laek (2) - 383 freq lander (2) - 13 freq lanes (2) - 11 freq faker (2) - 3 freq aaner (2) - 1 freq nayter (2) - 2 freq laar (2) - 2 freq buyer (2) - 8 freq |
layer (0) - 13 freq laer (1) - 1 freq laayer (1) - 5 freq lare (2) - 7 freq laur (2) - 1 freq ler (2) - 1 freq aaler (2) - 17 freq elyer (2) - 1 freq lair (2) - 57 freq laar (2) - 2 freq leer (2) - 4 freq fayer (2) - 3 freq lager (2) - 38 freq layert (2) - 2 freq layen (2) - 2 freq layed (2) - 16 freq lawyer (2) - 33 freq lawer (2) - 10 freq layers (2) - 20 freq later (2) - 550 freq payer (2) - 1 freq player (2) - 116 freq laser (2) - 4 freq mayer (2) - 1 freq aser (3) - 1 freq |
SoundEx code - L600 leerie - 22 freq lory - 42 freq lower - 57 freq leear - 16 freq lure - 6 freq lair - 57 freq lawer - 10 freq lere - 2 freq larry - 105 freq lawyer - 33 freq 'leear - 1 freq lairie - 2 freq laayer - 5 freq leir - 20 freq liar - 24 freq lorry - 14 freq lear - 107 freq lour - 5 freq lore - 12 freq leary - 1 freq lara - 1 freq laura - 190 freq laur - 1 freq lora - 1 freq leer - 4 freq laar - 2 freq lare - 7 freq layower - 1 freq loire - 8 freq loor - 2 freq layer - 13 freq lowry - 2 freq lowrie - 19 freq lyrie - 1 freq lowra - 1 freq lyare - 1 freq lire - 2 freq lauri - 1 freq laer - 1 freq lee-er - 1 freq l'or' - 1 freq lyre - 1 freq 'larry - 1 freq lawrie - 4 freq larrie - 2 freq lori - 1 freq larrea - 1 freq lir - 16 freq lr - 5 freq lurie - 1 freq ler - 1 freq lri - 1 freq 'lorry - 1 freq 'lower - 1 freq |
MetaPhone code - LYR lawyer - 33 freq laayer - 5 freq layer - 13 freq lyare - 1 freq |
LAYER |
| Time to execute Levenshtein function - 0.178574 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.332898 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.027330 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.036967 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.000826 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. |