| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| labyrinth (0) - 22 freq labyrinths (1) - 1 freq ladyjinty (3) - 2 freq labyrinthine (3) - 1 freq labbyists (4) - 4 freq slabbrin (4) - 1 freq lairin (4) - 2 freq saberin (4) - 1 freq laith (4) - 25 freq layerin (4) - 1 freq lanth (4) - 3 freq laying (4) - 8 freq strinth (4) - 12 freq waarint (4) - 1 freq lerint (4) - 1 freq brith (4) - 4 freq bridth (4) - 5 freq lairit (4) - 1 freq latrines (4) - 3 freq labourin' (4) - 1 freq lab-rat (4) - 1 freq byrant (4) - 1 freq layin' (4) - 2 freq labourin (4) - 3 freq laarant (4) - 1 freq |
labyrinth (0) - 22 freq labyrinths (2) - 1 freq labyrinthine (4) - 1 freq laarant (6) - 1 freq laburnum (6) - 1 freq labourin (6) - 3 freq labourin' (6) - 1 freq linth (6) - 42 freq byrant (6) - 1 freq byrth (6) - 1 freq abernethy (6) - 3 freq labouring (6) - 2 freq lairnt (6) - 54 freq bridth (6) - 5 freq larnt (6) - 13 freq gabireith (6) - 1 freq lanth (6) - 3 freq strinth (6) - 12 freq brith (6) - 4 freq lerint (6) - 1 freq ladyjinty (6) - 2 freq breath (7) - 233 freq branch (7) - 44 freq carinthia (7) - 1 freq lenth (7) - 83 freq |
SoundEx code - L165 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.208876 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.346414 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.027782 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.038641 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.000893 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. |