Development Design pattern for Best Fit Filtering

In our Org we have quite a few places were data is auto populated based on other data selected. This however comes with allot of rules. When I started, we had allot of issues where sometimes the incorrect data is selected. This required a rewrite of the filtering to find the correct data but often … Continue reading Development Design pattern for Best Fit Filtering

ITS Website is Live

After 10 Years at my current company we eventually have a website that I can give to the public and not cringe. We have always worked on word of mouth and no one ever found us on the web. But it always bothered me that we did not have a proper website. That all changed … Continue reading ITS Website is Live


The Levenshtein distance is a string metric for measuring difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. The Levenshtein Algorithm - Cuelogic .....In Other words It is a algorithm to determine how close 2 strings match … Continue reading NAV-Levenshtein-Distance