| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chat-line (0) - 1 freq cat-like (2) - 1 freq caroline (3) - 26 freq chailie (3) - 1 freq cattlie (3) - 2 freq cashline (3) - 1 freq challice (3) - 1 freq chattie (3) - 1 freq chattin (3) - 22 freq coastline (3) - 6 freq chaurlie (3) - 1 freq claes-line (3) - 1 freq hairline (3) - 3 freq cult-like (3) - 1 freq chairlie (3) - 273 freq whit-like (3) - 1 freq hotline (3) - 1 freq chaiplie (3) - 1 freq chain-link (3) - 2 freq charlie (3) - 88 freq catilin (3) - 1 freq hert-line (3) - 1 freq chatrie (3) - 1 freq hair-line (3) - 1 freq chaine (3) - 6 freq |
chat-line (0) - 1 freq cat-like (4) - 1 freq chain-link (5) - 2 freq hotline (5) - 1 freq whit-like (5) - 1 freq childline (5) - 1 freq catilin (5) - 1 freq charlene (5) - 519 freq hair-line (5) - 1 freq hert-line (5) - 1 freq cult-like (5) - 1 freq cheetlin (5) - 1 freq echty-nine (5) - 1 freq chattin (5) - 22 freq claes-line (5) - 1 freq coastline (5) - 6 freq catalonie (6) - 1 freq whuttlin (6) - 2 freq chaplain (6) - 1 freq cheatin (6) - 4 freq cowt-lik (6) - 1 freq whit-lik (6) - 1 freq cantlin (6) - 1 freq chattles (6) - 2 freq richt-like (6) - 2 freq |
SoundEx code - C345 cheetlin - 1 freq cuddlin - 4 freq cuddle-an - 1 freq catalan - 24 freq catalans - 3 freq catalonia - 8 freq cuittle'm - 1 freq codlin's - 13 freq codlins - 4 freq codlin - 3 freq cuddlean - 1 freq catalunya - 3 freq catilin - 1 freq chat-line - 1 freq cuddlan - 1 freq cowdlin - 1 freq catalonians - 2 freq cattleman - 2 freq coddlin - 1 freq cuttlin - 1 freq €˜cotillions - 1 freq catalunia - 1 freq cuddling - 1 freq caitlinlfcx - 1 freq caitlin - 3 freq catalonie - 1 freq cdolan - 12 freq |
MetaPhone code - XTLN cheetlin - 1 freq shetlan - 12 freq shaetlan - 284 freq chat-line - 1 freq €˜shaetlan - 3 freq shætlan - 8 freq shetlan' - 1 freq |
CHAT-LINE |
| Time to execute Levenshtein function - 0.228693 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.392534 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.027696 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.037359 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.000867 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. |