Approximate data structures allow for some imprecision in the inputs. For example, the standard dictionary data structure provides a container for a set of key-value pairs that supports an exact lookup(k) function that returns the value, if any, associated with key k. An approximate dictionary supports an enhanced search capability lookup*(k, e) that finds all values associated with keys "close to" k i.e. within a "distance" e (suitable defined). The object of this project if to develop an implementation for this concept and bundle it as an efficient Python package.