Zobrazeno 1 - 10
of 20
pro vyhledávání: '"H S Dhami"'
Publikováno v:
Digital Scholarship in the Humanities. 34:558-568
A language-independent stemmer has always been looked for. Single N-gram tokenization technique works well; however, it often generates stems that start with intermediate characters, rather than initial ones. We present a novel technique that takes t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d531b29542b5fe09570c7090e0f6d006
https://doi.org/10.1093/llc/fqy053
https://doi.org/10.1093/llc/fqy053
Autor:
H. S. Dhami, Hemlata Pande
Publikováno v:
Journal of Research Design and Statistics in Linguistics and Communication Science. 4:73-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfd0b60e9f6a34e31ac8bc74d00282ae
https://doi.org/10.1558/jrds.33107
https://doi.org/10.1558/jrds.33107
Autor:
Hemlata Pande, H. S. Dhami
Publikováno v:
Journal of Quantitative Linguistics. 22:22-43
The present paper is an attempt at analysing the pattern of occurrence of different alphabets of the Hindi alphabet or varṇamālā in the text and corpus of Hindi. One text has been selected and nine corpora have been formed and taken for the prese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfe841ab74bb2dbcf5509af2dd3a3a6a
https://doi.org/10.1080/09296174.2014.974457
https://doi.org/10.1080/09296174.2014.974457
Publikováno v:
International Journal of Applied Linguistics. 25:315-328
Suffix stripping is a problem of removing morphological suffixes from a word to get the stem. We present suffix stripping as an unconstrained optimization problem. Free from linguistic or morphological knowledge, a simple algorithm is being developed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::109e09ce20410349f3417024f237fc80
https://doi.org/10.1111/ijal.12071
https://doi.org/10.1111/ijal.12071
Publikováno v:
International Journal of Applied Information Systems. 5:25-29
In the present work an attempt is being made to reduce the Maximum Flow Network Interdiction Problem (MFNIP) in to the Subset Sum Problem so as to get some algorithms solvable in polynomial time. Previously developed algorithms are either applicable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd0c336131fc96b80204efa642d16a59
https://doi.org/10.5120/ijais12-450870
https://doi.org/10.5120/ijais12-450870
Publikováno v:
International Journal of Computer Applications. 60:27-34
The present paper aims at automated correction of verb from huge English corpus and addition of verbs at run time through single sentence. The approach deals with salient issues in the applications that use the artificial intelligence with respect to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2a69c4c98fb502b02549c85071bb1dd
https://doi.org/10.5120/9705-4155
https://doi.org/10.5120/9705-4155
Autor:
Hemlata Pande, H. S. Dhami
Publikováno v:
Journal of Quantitative Linguistics. 19:249-261
In the present paper we attempted to generate a parametric model for word frequencies. In order to make this relation applicable, we arranged word lengths in accordance with their normalized frequencies. The pattern of occurrence of words containing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb1132b7af01b8869a8af2527a3428b2
https://doi.org/10.1080/09296174.2012.714531
https://doi.org/10.1080/09296174.2012.714531
Publikováno v:
International Journal of Computer Applications. 51:37-42
The given paper is an attempt in the direction of generation of Primary data by refinement of secondary data available at www.Gotaggersoft.in . The Gotagger software only distinguishes the narrations in text but does not count them. To overcome this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84a8102d5dd6bc8a2f1aedd4ad2d9120
https://doi.org/10.5120/8089-1637
https://doi.org/10.5120/8089-1637
Publikováno v:
International Journal of Computer Applications. 42:16-19
an algorithm which reduces the arbitrary instance of the network flow problem to a simple path disjoint network in polynomial time. Then the flow in each path is taken as the minimum of the arc capacities of that path from where the flow in each arc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f4cd4503acba1a908c9f1fb64d36449
https://doi.org/10.5120/5783-8109
https://doi.org/10.5120/5783-8109
Autor:
B. P. Pande, H. S. Dhami
Publikováno v:
International Journal of Computer Applications. 27:14-19
In the present work an innovative attempt is being made to develop a novel conflation method that exploits the phonetic quality of words and uses some standard NLP tools like LD (Levenshtein Distance) and LCS (Longest Common Subsequence) for Stemming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcdb44508d49f45ccf06aa06a1229a29
https://doi.org/10.5120/3302-4530
https://doi.org/10.5120/3302-4530