![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
H. S. Dhami
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j8]Bhagwati Prasad Pande, Pawan Tamta, Hoshiyar S. Dhami:
Generation, implementation, and appraisal of an N-gram-based stemming algorithm. Digit. Scholarsh. Humanit. 34(3): 558-568 (2019) - 2015
- [j7]Hemlata Pande, Hoshiyar S. Dhami:
Analysis and Mathematical Modelling of the Pattern of Occurrence of Various Devanāgari Letter Symbols according to the Phonological Inventory of Indic Script in Hindi Language. J. Quant. Linguistics 22(1): 22-43 (2015) - [j6]Hemlata Pande, Hoshiyar S. Dhami:
Determination of the Distribution of Sentence Length Frequencies for Hindi Language Texts and Utilization of Sentence Length Frequency Profiles for Authorship Attribution. J. Quant. Linguistics 22(4): 338-348 (2015) - 2014
- [j5]Hemlata Pande, H. S. Dhami:
Statistical Methods in Language and Linguistic Research. J. Quant. Linguistics 21(3): 295-297 (2014) - [i6]Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami:
Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem. CoRR abs/1402.2022 (2014) - 2013
- [j4]Hemlata Pande, H. S. Dhami:
Mathematical Modelling of the Pattern of Occurrence of Words in Different Corpora of the Hindi Language. J. Quant. Linguistics 20(1): 1-12 (2013) - [i5]Bhagwati Prasad Pande, Pawan Tamta, H. S. Dhami:
Generation, Implementation and Appraisal of a Language Independent Stemming Algorithm. CoRR abs/1312.4824 (2013) - [i4]Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami:
Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem. CoRR abs/1312.6492 (2013) - [i3]Bhagwati Prasad Pande, Pawan Tamta, H. S. Dhami:
Suffix Stripping Problem as an Optimization Problem. CoRR abs/1312.6802 (2013) - 2012
- [j3]Hemlata Pande, H. S. Dhami:
Model generation for word length frequencies in texts with the application of Zipf's order approach. J. Quant. Linguistics 19(4): 249-261 (2012)
2000 – 2009
- 2009
- [j2]Hemlata Pande, H. S. Dhami:
Generation of a Model for Grapheme Frequencies and its Refinement and Validation by Group Theoretic Aspects. J. Quant. Linguistics 16(4): 307-326 (2009) - [i2]Rakesh Pandey, H. S. Dhami:
Mathematical Model for Transformation of Sentences from Active Voice to Passive Voice. CoRR abs/0903.5168 (2009) - 2008
- [i1]Raj Kishor Bisht, H. S. Dhami:
The Application of Fuzzy Logic to Collocation Extraction. CoRR abs/0811.1260 (2008) - 2006
- [j1]Raj Kishor Bisht
, H. S. Dhami, Neeraj Tiwari:
An evaluation of different statistical techniques of collocation extraction using a probability measure to word combinations. J. Quant. Linguistics 13(2-3): 161-175 (2006)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint