| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lawbourin (0) - 3 freq labourin (1) - 3 freq harbourin (2) - 1 freq lawbour (2) - 5 freq labourin' (2) - 1 freq lawbourt (2) - 1 freq labouring (2) - 2 freq saivourin (3) - 2 freq lawbors (3) - 1 freq labours (3) - 5 freq lourin (3) - 8 freq lawbur (3) - 1 freq labour (3) - 276 freq faivourin (3) - 1 freq savourin (3) - 7 freq lawbourers (3) - 3 freq laboured (3) - 5 freq allourin (3) - 1 freq laabours (3) - 1 freq neebourin (3) - 3 freq labourer (3) - 7 freq labour' (3) - 1 freq favourin (3) - 1 freq neibourin (3) - 5 freq lawborrow (3) - 2 freq |
lawbourin (0) - 3 freq labourin (2) - 3 freq lawbourt (3) - 1 freq lawbour (3) - 5 freq lawbur (4) - 1 freq lawbors (4) - 1 freq labouring (4) - 2 freq harbourin (4) - 1 freq labourin' (4) - 1 freq lawborch (5) - 1 freq lowderin (5) - 1 freq laubour (5) - 2 freq newborn (5) - 11 freq neibourin (5) - 5 freq lawborrow (5) - 2 freq lumberin (5) - 1 freq lisburn (5) - 1 freq labour' (5) - 1 freq lowrin (5) - 2 freq newboarn (5) - 2 freq lewderin (5) - 1 freq lowerin (5) - 12 freq laboured (5) - 5 freq labour (5) - 276 freq lourin (5) - 8 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 - LBRN labourin - 3 freq labourin' - 1 freq lawbourin - 3 freq libran - 1 freq |
LAWBOURIN |
| Time to execute Levenshtein function - 0.299864 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.619238 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.029305 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.075963 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.000944 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. |