My pride and joy - well so far at least. I finished up a specification on the algorithm I used to write DiggMatch. The algorithm is used for information retrieval, specifically taking a set of data, indexing it, then comparing other entities of data against the indexed set to see how related the entity and the table are too each other.

For example, say you were to visit the New York Times website every day for a week and save the text from stories that interested you. The indexing portion of RIMA could be applied to the saved text, creating a table of data. Then for every subsequent day, any given story on the NYT website could be compared to the table using the match portion of RIMA. A score would be returned representing the relevancy between the story and the table - the higher the score, the higher the relation. Using RIMA, a programmer can create a "recommended set of data/text" for a website, an essential part of any new web application.

RIMA can be downloaded in pdf format or viewed online in html.