Nodejs on David Hamp-Gonsalves

Javascript Damerau Levenshtein Algorithim

Tue, 20 Nov 2012 00:00:00 +0000

The Damerau Levenshtein algorithim calculates a distance between two words in the same way that basic Levenshtein does but adds transpositions to the set of operations that it uses to calculate distance. This makes it much more reliable at finding similiar or alternate spellings of words.

I was doing some nodejs work lately and needed such a function to clean up one of my datasets and so I ported this version from C# to Javascript.

Install Node.js / NPM on Fedora Core 17

Thu, 18 Oct 2012 00:00:00 +0000

This is just a short and sweet set of commands to install Nodejs and NPM on Fedora 17.

Versions

Fedora Core 17
node.js 0.8.9

The Guts(go bash go!)

sudo yum install openssl-devel.i686 gcc gcc-c++
sudo ./configure
sudo make -j2
sudo make install

su
cd /tmp
git clone https\://github.com/isaacs/npm.git
cd npm
make install
exit

Most of this was based on an older post I found here.

Iterative Javascript QuickSelect

Fri, 08 Jun 2012 00:00:00 +0000

A couple weeks ago I entered my first AI related contest, hosted by scribd. The contest was great for beginners since it involved a very simple world and control scheme.

At some point in by bot creation process I needed to determine the n-th highest number in an Array. While for such a simple project I probably should have just thrown some loops together and moved on, but since the project was just I started researching the problem and Hoare’s Selection Algorithm. I wasn’t able to find a Javascript implementation so I ported a Java version() which in turn had been ported over from the book “Numerical Recipes in C: The Art of Scientific Computing”. The best part about this implementation is that unlike most, it isn’t recursive. This makes it more verbose but much more interesting and it avoids any stack depth restrictions that browser vendors may impose.