Approximate String Matching
On Sale
€40.00
€40.00
Preview
In this workshop I explain in great detail how the Levenshtein Distance algorithm can be implemented in MS Access. This is one of the many existing "Approximate String Matching" algorithms, which provide a way to perform an approximate search on a list of strings.
This means that the users can enter an approximate search word, and still be able to get the result they are looking for.
Given its simplicity, it's a sure added value to your MS Access applications.
Duration: 32m 30s
This means that the users can enter an approximate search word, and still be able to get the result they are looking for.
Given its simplicity, it's a sure added value to your MS Access applications.
Duration: 32m 30s
