Efficient stemmer generation

Authors:
Brian Fox;Christopher J. Fox
Affiliations:
Department of Computer Science, James Madison University, MSC 4103, Harrisonburg, VA;Department of Computer Science, James Madison University, MSC 4103, Harrisonburg, VA
Venue:
Information Processing and Management: an International Journal
Year:
2002

Citing 6
Cited 3

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Lex & yacc

Lex & yacc
Another stemmer

ACM SIGIR Forum
Lexical analysis and stoplists

Information retrieval
Stemming algorithms

Information retrieval
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Is 1 noun worth 2 adjectives?: measuring relative feature utility

Information Processing and Management: an International Journal
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
An IPC-based vector space model for patent retrieval

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for generating stemmers from text stemmer specification files. A small study shows that the generated stemmers are computationally efficient, often running faster than stemmers custom written to implement particular stemming algorithms. The stemmer specification files are easily written and modified by non-programmers, making it much easier to create a stemmer, or tune a stemmer's performance, than would be the case with a custom stemmer program. Stemmer generation is thus also human-resource efficient.