Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Pawan Tamta"'
Autor:
Pawan Tamta, B. P. Pande
Publikováno v:
Vietnam Journal of Computer Science, Vol 7, Iss 2, Pp 129-144 (2020)
This work is an attempt to devise a Stemmer that can remove both prefix and suffix together from a given word in English language. For a given input word, our method considers all possible internal N-grams for detection of potential stems. We frame a
Externí odkaz:
https://doaj.org/article/fe8d16a901ab486da5b813401777be2b
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
Publikováno v:
Glottotheory. 8
The present work is an attempt to develop a database of hedges to study the usage and effects of hedges in women writings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e726cb7239ffbc9f107bf228cf183c6
https://doi.org/10.1515/glot-2017-0002
https://doi.org/10.1515/glot-2017-0002
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. 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
Publikováno v:
Glottotheory. 6
Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms targeting this problem have been developed in a haphazard manner. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::081bd47cf17173993e3e3c5f36452023
https://doi.org/10.1515/glot-2015-0013
https://doi.org/10.1515/glot-2015-0013