| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arabstar (0) - 3 freq scrabster (3) - 5 freq avatar (3) - 2 freq aaltar (3) - 2 freq arabest (3) - 3 freq ramstam (3) - 10 freq alabaster (3) - 3 freq arabs (3) - 4 freq labster (3) - 6 freq arbiter (3) - 2 freq wabster (3) - 17 freq 'ramstam (3) - 1 freq arabia' (3) - 1 freq arbitrar (3) - 1 freq arabian (3) - 1 freq arabia (3) - 3 freq alastair (3) - 10 freq brewstar (3) - 2 freq froestan (4) - 1 freq rasper (4) - 1 freq raesan (4) - 1 freq faister (4) - 16 freq ainster (4) - 2 freq faaster (4) - 6 freq waster (4) - 13 freq |
arabstar (0) - 3 freq labster (4) - 6 freq alabaster (4) - 3 freq arabest (4) - 3 freq arbiter (4) - 2 freq wabster (4) - 17 freq lobstir (5) - 1 freq roaster (5) - 17 freq brewstar (5) - 2 freq rooster (5) - 18 freq webster (5) - 8 freq hubster (5) - 1 freq lobster (5) - 23 freq okrabister (5) - 3 freq ragstore (5) - 1 freq alastair (5) - 10 freq artistry (5) - 1 freq ramstam (5) - 10 freq arabs (5) - 4 freq arbitrar (5) - 1 freq scrabster (5) - 5 freq orbital (6) - 3 freq gaavster (6) - 1 freq arrests (6) - 1 freq rasher (6) - 1 freq |
SoundEx code - A612 arrives - 16 freq arabs - 4 freq airwaves - 4 freq arphaxad - 2 freq airbugs - 1 freq arpachshad - 1 freq airwaves' - 1 freq airbase - 1 freq air-biggit - 1 freq arabic - 7 freq arpeggios - 1 freq arbuckle - 9 freq arbuckles - 1 freq arabstar - 3 freq airfix - 1 freq arabcarol - 2 freq arabshedboy - 2 freq aerobics - 3 freq arabzone - 2 freq arbikie - 1 freq arabest - 3 freq awrabest - 4 freq |
MetaPhone code - ARBSTR arabstar - 3 freq |
ARABSTAR |
| Time to execute Levenshtein function - 0.208414 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.411377 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.036217 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.040294 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.000964 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. |