Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
low-level (0) - 1 freq lowlevel (1) - 1 freq 'o'-levels (3) - 1 freq lochleven (3) - 1 freq sea-level (3) - 1 freq o-levels (3) - 2 freq however (4) - 61 freq lovel (4) - 1 freq no-weel (4) - 1 freq grun-level (4) - 1 freq for-weel (4) - 1 freq lowered (4) - 25 freq a-levels (4) - 1 freq know-never (4) - 1 freq oot-leives (4) - 1 freq low-pey (4) - 2 freq wow-ee (4) - 1 freq lowsened (4) - 2 freq lowlife (4) - 2 freq level (4) - 148 freq low-lying (4) - 1 freq howanever (4) - 23 freq howalee (4) - 1 freq loiterer (5) - 1 freq levels (5) - 66 freq |
low-level (0) - 1 freq lowlevel (2) - 1 freq sea-level (5) - 1 freq low-lying (6) - 1 freq lochleven (6) - 1 freq o-levels (6) - 2 freq 'o'-levels (6) - 1 freq lowlife (7) - 2 freq low-pey (7) - 2 freq law-plea (7) - 2 freq law-lyin (7) - 1 freq llvl (7) - 1 freq level (7) - 148 freq oot-leives (7) - 1 freq lovel (7) - 1 freq grun-level (7) - 1 freq a-levels (7) - 1 freq way-never (8) - 1 freq loonie'll (8) - 1 freq re-lived (8) - 1 freq new-lined (8) - 1 freq non-livin (8) - 1 freq twelves (8) - 1 freq twelve (8) - 89 freq lowland (8) - 32 freq |
SoundEx code - L414 lilly-flouer - 1 freq low-level - 1 freq lowlevel - 1 freq |
MetaPhone code - LLFL low-level - 1 freq lowlevel - 1 freq |
LOW-LEVEL |
Time to execute Levenshtein function - 0.274969 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.467391 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.033271 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.041240 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.001223 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. |