Investigate use of a 'perfect hash function'

[willscott]

since there are only 200 odd values, there should be some hash function that can compactly represent the current mapping. Likely this would need to be used in conjunction with a bloom filter to know if the entry is present or not. Potentially gets the result down to something really small.

[willscott]

There's a JS implementation of perfect hash generator here:
http://npmjs.org/package/perfect
although it doesn't do any minimization.

There's a paper on current best practices here:
http://cmph.sourceforge.net/papers/wads07.pdf