Implementation of Rule Based Algorithm for Sandhi-Vicheda Of Compound Hindi Words

IJCSI International Journal of Computer Science Issues, Vol. 3, 2009

ISSN (Online): 1694-0784

ISSN (Printed): 1694-0814

Table 8: Rule VII Implemented Word List

Step 4.8: (Rule for eliminating the half letter in
Sandhi- Vicheda) If find the (Half CH) (P) Letter then
eliminates the Letter and decompose the word.

Table 9: Rule VIII Implemented Word List

Step 4.9: (Rule of Visarga in Sandhi Vicheda) If find
the (Half Letter) then replace with Sign ( : )visarga.

Table 10: Rule IX Implemented Word List

Step 5: Repeat Steps 4.1 to 4.9 to check the next word
for checking the Vyanjan that combined with Matra.
Then replace the Matra with Swar.

Step 6: Find the Unicode value for each of the Hindi
characters and additional characters and use those
values to implement above rules.

Step 7: Display the results.

Our module was developed in Visual Basic.NET
(2005) and the encoding used for text was in Unicode,
most suitable for other applications as well. Unicode
uses a 16 bit encoding that provision for 65536
characters. Unicode standard [18] assigns each
character a unique numeric value and name. Presently
it provides codes for 49194 characters:

In Hindi Language:      Total Swar=13

Total Vyanjan=33

Total Matra=13

V RESULTS AND DISCUSSION

We have tested our software on more than 200 words.
Using the Rule based algorithm we have reported an
accuracy of 60-80% depending upon the number of
rules to be implemented. SANDHI-VICHEDA is an
easy and interesting way that can give entirely new
dimension that add new way to traditional approach to
Hindi Teaching.

VI CONCLUSION AND FUTURE WORK

In this paper, we presented the technique for the
Sandhi-Vicheda of compound hindi words. Using the
Rule based algorithm we have reported an accuracy of
60-80% depending upon the number of rules to be
implemented. As future work, database can be
extended to include more entries to improve the
accuracy. This software can be used as a teaching aid
to all the students from Class-V to the highest level of
education. With this software one can learn about the
very important aspect of Hindi Grammar i.e.
‘SANDHI-VICHEDA’. By adding new more features,
we can upgrade it to learn all the aspects of Hindi
Grammar. It can also be used to solve and test the
problems related to Hindi Grammar.

ACKNOWLEDGEMENT

We would like to thank Dr. G.S. Lehal, Professor and
Head, Department of Computer Science, Punjabi
University, Patiala for many helpful suggestions and
comments.

REFERENCES

[1] Bharati, Akshar, Vineet Chaitanya & Rajeev Sangal,
1991, A Computational Grammar for Indian languages
processing, Indian Linguistics Journal, pp.52, 91-103.

[2] Bharati A., Chaitanya V and Sangal R, "Natural
Language processing: A Paninian Perspective", Prentice
Hall of India, 1995.

[3] Cheng, Chin-Chuan “English Stresses and Chinese Tones
in Chinese Sentences” California University, Berkeley,
Phonology Laboratory.

[4] Dan W. Patterson “Introduction to Artificial Intelligence
and Expert Systems” Prentice Hall P-227.

IJCSI

<<   <   1   2   3   4   5