| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glenboor (0) - 1 freq glencoe (3) - 6 freq glenburn (3) - 2 freq glenore (3) - 6 freq neeboor (3) - 1 freq lebor (3) - 1 freq glenbogle (3) - 1 freq glenlyon (3) - 6 freq glenoe (3) - 1 freq gaen-oot (3) - 1 freq glenbuck (3) - 1 freq doonpoor (4) - 2 freq glebe (4) - 6 freq glenure (4) - 7 freq girnwood (4) - 4 freq peeoor (4) - 1 freq gener (4) - 1 freq gloop (4) - 1 freq vendor (4) - 1 freq eleanor (4) - 10 freq glen' (4) - 1 freq gleb (4) - 1 freq glentin (4) - 34 freq glamour (4) - 29 freq fleerboord (4) - 2 freq |
glenboor (0) - 1 freq glenburn (4) - 2 freq glenore (4) - 6 freq glenbuck (5) - 1 freq glabber (5) - 1 freq glenure (5) - 7 freq glenoe (5) - 1 freq glinder (5) - 4 freq glencoe (5) - 6 freq glenlyon (5) - 6 freq lebor (5) - 1 freq neeboor (5) - 1 freq glenbogle (5) - 1 freq glenshee (6) - 11 freq glenty (6) - 1 freq glen's (6) - 4 freq glentan (6) - 1 freq glenn (6) - 1 freq gleniffer (6) - 2 freq blender (6) - 3 freq glour (6) - 1 freq govnor (6) - 1 freq 'labour (6) - 1 freq glenogle (6) - 1 freq labour (6) - 276 freq |
SoundEx code - G451 glimp - 6 freq glenfiddich - 2 freq glimpses - 3 freq glenbervie - 2 freq glimpse - 20 freq glenaphooka - 1 freq glenboor - 1 freq glimpsing - 1 freq glenfarg - 4 freq gleniffer - 2 freq glimpst - 1 freq glumpy - 1 freq glimpsed - 1 freq glampigleek - 3 freq gallimaufry - 1 freq glimps - 1 freq gallimaufray - 1 freq glimped - 2 freq glenbogle - 1 freq glenfinnan - 1 freq glenburn - 2 freq gwilymbowenrhys - 1 freq glennbbc - 4 freq glenfearce - 2 freq glenbuck - 1 freq |
MetaPhone code - KLNBR glenboor - 1 freq |
GLENBOOR |
| Time to execute Levenshtein function - 0.506428 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.720330 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.030405 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.069452 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.000886 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. |