A Case Study of Using Domain Engineering for the Conflation Algorithms Domain

Authors:
Okan Yilmaz;William B. Frakes
Affiliations:
Computer Science Department, Virginia Tech,;Computer Science Department, Virginia Tech,
Venue:
ICSR '09 Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering
Year:
2009

Citing 8
Cited 0

Another stemmer

ACM SIGIR Forum
Stemming algorithms

Information retrieval
Viewing morphology as an inference process

SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
DARE: Domain analysis and reuse environment

Annals of Software Engineering
Efficient stemmer generation

Information Processing and Management: an International Journal
Strength and similarity of affix removal stemming algorithms

ACM SIGIR Forum
Software Reuse Research: Status and Future

IEEE Transactions on Software Engineering
Automatic Information Organization and Retrieval.

Automatic Information Organization and Retrieval.

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study we used domain engineering as a method for gaining deeper formal understanding of a class of algorithms. Specifically, we analyzed 6 stemming algorithms from 4 different sub-domains of the conflation algorithms domain and developed formal domain models and generators based on these models. The application generator produces source code for not only affix removal but also successor variety, table lookup, and n-gram stemmers. The performance of the generated stemmers was compared with the stemmers developed manually in terms of stem similarity, source, and executable sizes, and development and execution times. Five of the stemmers generated by the application generator produced more than 99.9% identical stems with the manually developed stemmers. Some of the generated stemmers were as efficient as their manual equivalents and some were not.