Research Article
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. |
|