| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| labour-intensive (0) - 1 freq labour-men (7) - 1 freq intensive (7) - 7 freq labyrinthine (7) - 1 freq lgbti-inclusive (7) - 1 freq labour-led (8) - 1 freq labouring (8) - 2 freq labour-liberal (8) - 1 freq aritenite (8) - 1 freq labourin (8) - 3 freq all-inclusive (8) - 1 freq favourites (8) - 27 freq bourgeotsie (8) - 1 freq labourers (8) - 4 freq labourin' (8) - 1 freq labouroutofscot (8) - 1 freq apprehensive (8) - 2 freq labyrinths (8) - 1 freq aboundantlie (8) - 1 freq yaiser-freenlie (9) - 1 freq hortensia (9) - 31 freq labourleft (9) - 1 freq countenance (9) - 3 freq bourgeoisie (9) - 2 freq incentive (9) - 6 freq |
labour-intensive (0) - 1 freq lgbti-inclusive (11) - 1 freq labyrinthine (11) - 1 freq labyrinths (11) - 1 freq intensive (11) - 7 freq labour-men (11) - 1 freq all-inclusive (12) - 1 freq bruntons (13) - 3 freq laboratories (13) - 1 freq subordinates (13) - 1 freq elaborates (13) - 1 freq labyrinth (13) - 22 freq abortions (13) - 1 freq apprehensive (13) - 2 freq lountons (13) - 1 freq bur-ness (13) - 1 freq labourin (13) - 3 freq labour-liberal (13) - 1 freq labouring (13) - 2 freq labour-led (13) - 1 freq labouroutofscot (13) - 1 freq bourgeotsie (13) - 1 freq labourin' (13) - 1 freq labourers (13) - 4 freq britons (14) - 2 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 - LBRNTNSF labour-intensive - 1 freq |
LABOUR-INTENSIVE |
| Time to execute Levenshtein function - 0.489276 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 - 1.001773 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.027536 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.095586 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.000897 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. |