Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
larrea (0) - 1 freq arra (2) - 31 freq barra (2) - 27 freq large (2) - 56 freq garret (2) - 4 freq lurred (2) - 1 freq marra (2) - 19 freq narra (2) - 38 freq larned (2) - 12 freq harra (2) - 2 freq garred (2) - 22 freq lare (2) - 7 freq larger (2) - 3 freq larder (2) - 9 freq laurel (2) - 4 freq barrel (2) - 40 freq narrer (2) - 2 freq larries (2) - 8 freq laura (2) - 190 freq farrer (2) - 27 freq narraa (2) - 1 freq barred (2) - 15 freq carred (2) - 1 freq darren (2) - 8 freq larrie (2) - 2 freq |
larrea (0) - 1 freq larry (2) - 105 freq larrie (2) - 2 freq varra (3) - 1 freq laren (3) - 21 freq narraa (3) - 1 freq laura (3) - 190 freq lara (3) - 1 freq lauren (3) - 21 freq lorry (3) - 14 freq larne (3) - 19 freq larva (3) - 1 freq larries (3) - 8 freq tarra (3) - 1 freq laired (3) - 8 freq large (3) - 56 freq marra (3) - 19 freq lare (3) - 7 freq narra (3) - 38 freq arra (3) - 31 freq harra (3) - 2 freq lurred (3) - 1 freq barra (3) - 27 freq laurel (3) - 4 freq larder (3) - 9 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 - LR leerie - 22 freq lory - 42 freq leear - 16 freq lure - 6 freq lair - 57 freq lere - 2 freq larry - 105 freq 'leear - 1 freq lairie - 2 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 loire - 8 freq loor - 2 freq lowry - 2 freq lowrie - 19 freq lyrie - 1 freq lowra - 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 wler - 1 freq lri - 1 freq 'lorry - 1 freq |
LARREA |
Time to execute Levenshtein function - 0.208431 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.361420 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.028678 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.037924 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.000902 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. |