| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| labyrinth (0) - 22 freq labyrinths (1) - 1 freq labyrinthine (3) - 1 freq ladyjinty (3) - 2 freq larnt (4) - 13 freq labouring (4) - 2 freq laying (4) - 8 freq laith (4) - 25 freq pawprints (4) - 1 freq labourin' (4) - 1 freq labourin (4) - 3 freq laarant (4) - 1 freq mayritt (4) - 1 freq brith (4) - 4 freq lairit (4) - 2 freq linth (4) - 42 freq lerint (4) - 1 freq bridth (4) - 5 freq layerin (4) - 1 freq wabring (4) - 1 freq byrant (4) - 1 freq lanth (4) - 3 freq lairnt (4) - 54 freq labbyists (4) - 4 freq slabbrin (4) - 1 freq |
labyrinth (0) - 22 freq labyrinths (2) - 1 freq labyrinthine (4) - 1 freq abernethy (6) - 3 freq byrant (6) - 1 freq lerint (6) - 1 freq lairnt (6) - 54 freq bridth (6) - 5 freq gabireith (6) - 1 freq byrth (6) - 1 freq strinth (6) - 12 freq linth (6) - 42 freq laburnum (6) - 1 freq lanth (6) - 3 freq larnt (6) - 13 freq labourin' (6) - 1 freq labouring (6) - 2 freq labourin (6) - 3 freq ladyjinty (6) - 2 freq brith (6) - 4 freq laarant (6) - 1 freq braith (7) - 218 freq birnt (7) - 1 freq libran (7) - 1 freq carinthia (7) - 1 freq |
SoundEx code - L165 lapperin - 1 freq labyrinth - 22 freq lipperin - 8 freq labourin - 3 freq lipperan - 2 freq laburnum - 1 freq life-rent - 1 freq labyrinthine - 1 freq leverin - 2 freq labyrinths - 1 freq labour-men - 1 freq labouring - 2 freq labourin' - 1 freq life-worn - 1 freq lawbourin - 3 freq labour-intensive - 1 freq lfrmr - 1 freq libran - 1 freq loveworms - 1 freq 'laverni' - 1 freq 'liverni' - 1 freq |
MetaPhone code - LBRN0 labyrinth - 22 freq |
LABYRINTH |
| Time to execute Levenshtein function - 0.188494 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.340570 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.027122 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.036970 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. |