Using concepts from the "Sparse Distributed Representation (SDR)" of Hawkins et al to implement an approach to finding hypernyms.
This leads to a much more natural solution than I was pursuing in the total_recall.ppt file.
Putting code directly under Files tab, as I appear to be git-hub challenged.
Also, the file bltj2.doc contains a paper describing the graph algorithm as used in a telcom analysis.