Exploiting Semantic Annotations and -Learning for Constructing an Efficient Hierarchy/Graph Texts Organization

Algorithm 2

C-SynD algorithm.

Input: Array Feature_Vertex Objects (FVO), Wordnet

Output: List of Closest-Synonym of FVO objects /^*The detected closest synonym to set Fsyn value. /^*

Procedure

 {SRL ← Empty list {list of each synonym and their relationships};

 F_SRList ← Empty list {list of SRL (all synonyms and their relationships lists)};

 /^*Parallel.foreach used for parallel processing of all FVO. /^*

 Parallel.ForEach(FVO, fvo => {

 Fsyn ← Empty list;

 F_SRList = get_all_Syn_Relations_List(fvo); /^* function to get all synonyms and their relationships lists from wordnet /^*

 /^* compute semantic relatedness of each synonym and their relationships with the fvo object then get score of each list/^*

  for (int ; _SRList.Count(); ++)

   { score[] = sum(function_Get_SemRel(F_SRList[], fvo)); /^*function to compute the score of each

  synonym list, this score contributes in accurate filtering the returned synonyms and selecting the closest one/^*

   }

  Fsyn = max_th(score); /^*function to select SRL with highest score according to the specific threshold /^*

 }); // Parallel.For

}