| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| glbtm (0) - 1 freq gloam (2) - 5 freq glt (2) - 1 freq lbtmf (2) - 1 freq glim (2) - 8 freq gibt (2) - 3 freq glett (2) - 2 freq glaim (2) - 4 freq album (2) - 24 freq gleam (2) - 7 freq wltm (2) - 1 freq glaum (2) - 4 freq glit (2) - 1 freq glum (2) - 10 freq govtm (2) - 1 freq glam (2) - 3 freq glut (2) - 5 freq glute (2) - 1 freq gloom (2) - 32 freq grtm (2) - 1 freq gloum (2) - 1 freq ludm (3) - 1 freq lits (3) - 15 freq lota (3) - 1 freq lbao (3) - 1 freq |
glbtm (0) - 1 freq govtm (4) - 1 freq glum (4) - 10 freq glit (4) - 1 freq glam (4) - 3 freq glute (4) - 1 freq gloum (4) - 1 freq gloom (4) - 32 freq glaum (4) - 4 freq glut (4) - 5 freq grtm (4) - 1 freq glim (4) - 8 freq lbtmf (4) - 1 freq gloam (4) - 5 freq wltm (4) - 1 freq gibt (4) - 3 freq glt (4) - 1 freq album (4) - 24 freq glett (4) - 2 freq gleam (4) - 7 freq glaim (4) - 4 freq gallta (5) - 1 freq glert (5) - 1 freq glib (5) - 3 freq gleet (5) - 8 freq |
SoundEx code - G413 gluepot - 1 freq gloved - 4 freq gliffed - 3 freq galloped - 7 freq gallovidian - 1 freq globed - 1 freq gulpit - 3 freq gluffed - 10 freq gleeved - 1 freq golloped - 4 freq glaepit - 4 freq glaip'd - 1 freq glaipid - 1 freq gulped - 7 freq glivved - 1 freq glufft - 2 freq gluffit - 1 freq glovit - 1 freq glippit - 1 freq gullpit - 1 freq galevitchin - 1 freq glbtm - 1 freq |
MetaPhone code - KLBTM glbtm - 1 freq |
GLBTM |
| Time to execute Levenshtein function - 0.239003 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.552886 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.065825 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.044435 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.000929 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. |