THE ALGORITHM OF GIVING AUTOMATIC HARAKAT ON ARABIC SCRIPT
The majority of Arabic reference books in Arabic writing without a vowel/harakat cause students to have difficulty in learning Arabic. Reading Arabic Script without harakat requires an understanding of the science of Nahwu-Sharf (Arabic Grammar) to be able to understand its contents. Therefore, in...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Informatics Department, Engineering Faculty
2017-12-01
|
Series: | Jurnal Ilmiah Kursor: Menuju Solusi Teknologi Informasi |
Subjects: | |
Online Access: | https://kursorjournal.org/index.php/kursor/article/view/145 |
Summary: | The majority of Arabic reference books in Arabic writing without a vowel/harakat cause
students to have difficulty in learning Arabic. Reading Arabic Script without harakat
requires an understanding of the science of Nahwu-Sharf (Arabic Grammar) to be able to
understand its contents. Therefore, in this study the basic rules of Nahwu-Sharf Science
have been translated into an algorithm that can be used to provide an automatic harakat
on Arabic script (without harakat). Based on the interview results with the expert, six
examples of sentences that represented the types(conditions) of basic sentences in the
Arabic language have been used as scenarios to examine the generated algorithm. The
allowed sentence is limited to one sentence only and cannot be in the form of poetry or
satire. Additionally, Cyclomatic Complexity Testing is used to examine scenarios in a test
case. All the steps of the Cyclomatic Complexity have been performed, which are creating
the flowgraph, calculating the independent path, and testing scenario. The scenarios were
examined in a test case through 13-path test case examination and result match with
expected output. In addition, 24 examples which represented the six conditions have been
utilized to examine for more detailed analysis and also results accuracy 100% in
accordance with the basic rules of Nahwu-Sharf science.
|
---|---|
ISSN: | 0216-0544 2301-6914 |