Research Article
A Hidden Markov Model-Based Tagging Approach for Arabic Isnads of Hadiths
Algorithm 2
Find Transition Probability (A) Matrix.
(1) | Function Name: FindTransitionProbabilityMatrix | (2) | Function Input: Hadith-Annotated file | (3) | Function Output: TransitionProbabilityMatrix | (4) | START | (5) | FOR every state (Si) in States-Array | (6) | FOR every state (Sj) in States-Array | (7) | W = Number of (SiSj) sequence occurrences in in the Hadith-Annotated file | (8) | Z = Total number of Si occurrences in Hadith-Annotated file | (9) | Transition-Probability = (W/Z) | (10) | END |
|