Abstract. Query expansion has received extensive attention in information retrieval community. Although semantic based query expansion appears to be promising in improving retrieva...
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Lexical ontologies and semantic lexicons are important resources in natural language processing. They are used in various tasks and applications, especially where semantic process...