Computational Algorithms for Deep and Shallow Word Search in Sanskrit with Case-inflected Forms of Feminine and Neuter Nouns
Rajitha V.1, Suganya R.2, Meenakshi Lakshmanan3
1Rajitha V., Department of Computer Science, Meenakshi College for Women, Chennai, India.
2Suganya R.*, Department of Computer Science, Meenakshi College for Women, Chennai, India.
3Meenakshi Lakshmanan, Department of Computer Science, Meenakshi College for Women, Chennai, India.

Manuscript received on November 20, 2019. | Revised Manuscript received on November 26, 2019. | Manuscript published on 30 November, 2019. | PP: 3084-3094 | Volume-8 Issue-4, November 2019. | Retrieval Number: D7949118419/2019©BEIESP | DOI: 10.35940/ijrte.D7949.118419

Open Access | Ethics and Policies | Cite  | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Effective and comprehensive word-search in Sanskrit E-text is a non-trivial problem in natural language processing that has been solved in this work for the first time in the literature. The problem is also one of great benefit to a variety of users. The complexity of the problem stems from the fact that words in Sanskrit can get completely metamorphosed on account of the phenomena of euphonic conjunctions and case-inflected forms. This work deals with the case-inflected forms of feminine and neuter gender nouns in particular, and their bearing on the search problem. The novel computational model presented here for generating case-inflected forms of Sanskrit nouns involves a categorization of word forms and a development of new formulae to achieve the generation of case-inflected forms. Pre-processing to improve the performance of the algorithm based on these formulae has also been developed. This model has been extended to include processing of euphonic conjunctions to enable a more elaborate search and to thereby produce meaningful search results. The dual paradigms of deep/slow and shallow/fast searching have been handled in this work and the efficiency of the fast search algorithm developed is shown to have an increased efficiency of 77-80%. The work also discusses the trade-off between search accuracy and speed in the context of word-search in Sanskrit E-text.
Keywords: Case Inflections, Vibhakti, Word Search, Sanskrit, Declension.
Scope of the Article: Parallel and Distributed Algorithms.