Lebart and Rajman ( 2000 ) argue for application-specific evaluation of similarity measures , because measures are always used for some task .
computing similarity
Ludovic Lebart Martin Rajman
The latter question is tackled by applicationspecific evaluation , where a measure is tested within the framework of a certain application , e.g. word sense disambiguation ( Patwardhan et al. , 2003 ) or malapropism detection ( Budanitsky and Hirst , 2006 ) . Lebart and Rajman ( 2000 ) argue for application-specific evaluation of similarity measures , because measures are always used for some task . But they also note that evaluating a measure as part of a usually complex application only indirectly assesses its quality .
@@CITATION argue for application-specific evaluation of similarity measures , because measures are always used for some task .