An application of pattern matching stemmer in arabic dialogue system

Authors:
Mohammad Hijjawi;Zuhair Bandar;Keeley Crockett;David Mclean
Affiliations:
School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom;School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom;School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom;School of Computing, Mathematics and Digital Technology, Manchester Metropolitan University, Manchester, United Kingdom
Venue:
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Year:
2011

Citing 3
Cited 0

Comparing words, stems, and roots as index terms in an Arabic Information Retrieval System

Journal of the American Society for Information Science
Towards an error-free Arabic stemming

Proceedings of the 2nd ACM workshop on Improving non english web searching
Automatic tagging of Arabic text: from raw text to base phrase chunks

HLT-NAACL-Short '04 Proceedings of HLT-NAACL 2004: Short Papers

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes the building of a stemmer for the Arabic language. This stemmer is largely based on pattern matching and pattern strength techniques. Stemmers are algorithms to extract root from a word by removing its affixes. Stemming has been applied for large number of applications, such as: indexing, information retrieval systems, and web search engines. This paper will also proposes the application of stemming as a pre-processing stage in a dialogue system (DS). The proposed stemmer was compared with three other well known stemmers and achieved favourable accuracy.