Contribution to Semantic Analysis of Arabic Language

Algorithm 4

Simplified Lesk algorithm.

Begin

  Score ← 0

  Sens ← 1  // Choose the sense

  𝐶← context (𝑡)   // Context of the word 𝑡

  For all I ∈ [1, 𝑁]

    𝐷← description (si)

  Sup ← 0

  For all 𝑤 ∈ 𝐶 do

   𝑤← description (𝑤)

   sup ← sup + score (𝐷, 𝑤)

  if sup > score then

   Score ← sup

   Sens ← 𝑖

End.