ACM SIGIR Forum
Information retrieval
Ontological Profiles as Semantic Domain Representations
NLDB '08 Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems
Using Stemming Algorithms on a Grid Environment
High Performance Computing for Computational Science - VECPAR 2008
A Case Study of Using Domain Engineering for the Conflation Algorithms Domain
ICSR '09 Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering
Combining ontological profiles with context in information retrieval
Data & Knowledge Engineering
An efficient mechanism for stemming and tagging: the case of Greek language
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
Benchmarking and assessing the performance of Arabic stemmers
Journal of Information Science
GRAS: An effective and efficient stemming algorithm for information retrieval
ACM Transactions on Information Systems (TOIS)
Distribution based stemmer refinement
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Poor man’s stemming: unsupervised recognition of same-stem words
AIRS'06 Proceedings of the Third Asia conference on Information Retrieval Technology
Arabic texts analysis for topic modeling evaluation
Information Retrieval
Stemming arabic conjunctions and prepositions
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Analysis and evaluation of stemming algorithms: a case study with Assamese
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
An improved stemming approach using HMM for a highly inflectional language
CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
Classification Method for Learning Morpheme Analysis
Journal of Information Technology Research
| Hi-index | 0.00 |
This study evaluated the strength of, and similarity among, four affix removal stemming algorithms. Strength and similarity were evaluated in different ways, including new metrics based on the Hamming distance measure. Data was collected on stemmer outputs for a list of 49,656 English words derived from the UNIX spelling dictionary and the Moby corpus. Conclusions about the relative strength and similarity of the four stemming algorithms are reported.