Spent most of the day on my second DH 2010 submission, on the Universal Similarity Metric. In the process of writing it, I went back to work with the Delphi prototype, and although I do like Delphi, it's really obvious that Java is a better platform for this particular application; its GUI doesn't need to be rich, and the XPath limitations on Delphi are a bit too constraining, and in any case it would be useful to have the actual algorithm available in a jar file you could call on the command line, so it could be integrated into other apps. It also occurred to me that I should run some of the cluster analysis stuff I did with Douglas, Lytton and Newcastle's writing using the Universal Similarity Metric instead of the word-based analysis, and see what kind of results appear. Might be quite revealing -- or not, but in either case, the results would bear reporting alongside the rest of the material in the paper.