SSP Group Meeting

11am, 18 July, 2006
Room 4.03
CISA, School of Informatics
University of Edinburgh

Perfect and Approximate Matching in OpenKnowledge

Fiona McNeill

I will discuss where and when matching is necessary for OpenKnowledge peers using LCC interaction models and suggest methods for dealing with these matching needs.  In many situations, it will not be possible to find exact matches and in such cases we need to find approximate matches.  We then need some method of evaluating how good these approximations are so that we can select the best match in each situation and then determine whether this exceeds some threshold 'good enough' value.  Much of this work is still rather speculative and any feedback would be much appreciated.