Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Meenakshi, Lakshmanan"'
Publikováno v:
Journal of Computer Science (ISSN Print: 1549-3636, ISSN Online: 1552-6607), December 2014, Volume 10, Issue 11, Pages 2269-2283
The problem of word search in Sanskrit is inseparable from complexities that include those caused by euphonic conjunctions and case-inflections. The case-inflectional forms of a noun normally number 24 owing to the fact that in Sanskrit there are eig
Externí odkaz:
http://arxiv.org/abs/1412.5477
The problem of word search in Sanskrit is inseparab le from complexities that include those caused by euphonic conjunctions and case-inflections. The cas e-inflectional forms of a noun normally number 24 owing to the fact that in Sanskrit there are e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8907054f945b7e6922b7d90a42fc10b7