Stemming algorithm for different tenses to improve Persian dictionary

Arash Ghazvini, Mohd Juzaiddin Ab Aziz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Persian language is an Indo-European language that is known for its complexity due to the morphology structure. In this paper, we report on Persian stemmer and the impact on improvement of Persian dictionary. Persian language consists of a variety of tenses, while the focus is on past subjunctive, past perfect, continuous past, present perfect and past simple. In Persian language, it is important to get rid of affixes from the verbs to obtain the stem. Therefore, finite state machine has been chosen to develop a Persian stemmer. According to the findings and testing results, Persian stemming algorithm based dictionary is fully accurate for the regular verbs in mentioned tenses.

Original languageEnglish
Title of host publicationISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications
Pages50-53
Number of pages4
DOIs
Publication statusPublished - 2012
Event2012 IEEE Symposium on Industrial Electronics and Applications, ISIEA 2012 - Bandung
Duration: 23 Sep 201226 Sep 2012

Other

Other2012 IEEE Symposium on Industrial Electronics and Applications, ISIEA 2012
CityBandung
Period23/9/1226/9/12

Fingerprint

Glossaries
Finite automata
Testing

Keywords

  • Algorithm
  • Dictionary
  • Persian
  • Stemming

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ghazvini, A., & Ab Aziz, M. J. (2012). Stemming algorithm for different tenses to improve Persian dictionary. In ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications (pp. 50-53). [6496669] https://doi.org/10.1109/ISIEA.2012.6496669

Stemming algorithm for different tenses to improve Persian dictionary. / Ghazvini, Arash; Ab Aziz, Mohd Juzaiddin.

ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications. 2012. p. 50-53 6496669.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ghazvini, A & Ab Aziz, MJ 2012, Stemming algorithm for different tenses to improve Persian dictionary. in ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications., 6496669, pp. 50-53, 2012 IEEE Symposium on Industrial Electronics and Applications, ISIEA 2012, Bandung, 23/9/12. https://doi.org/10.1109/ISIEA.2012.6496669
Ghazvini A, Ab Aziz MJ. Stemming algorithm for different tenses to improve Persian dictionary. In ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications. 2012. p. 50-53. 6496669 https://doi.org/10.1109/ISIEA.2012.6496669
Ghazvini, Arash ; Ab Aziz, Mohd Juzaiddin. / Stemming algorithm for different tenses to improve Persian dictionary. ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications. 2012. pp. 50-53
@inproceedings{01ec0deec2414189ba7f99e632e102ed,
title = "Stemming algorithm for different tenses to improve Persian dictionary",
abstract = "Persian language is an Indo-European language that is known for its complexity due to the morphology structure. In this paper, we report on Persian stemmer and the impact on improvement of Persian dictionary. Persian language consists of a variety of tenses, while the focus is on past subjunctive, past perfect, continuous past, present perfect and past simple. In Persian language, it is important to get rid of affixes from the verbs to obtain the stem. Therefore, finite state machine has been chosen to develop a Persian stemmer. According to the findings and testing results, Persian stemming algorithm based dictionary is fully accurate for the regular verbs in mentioned tenses.",
keywords = "Algorithm, Dictionary, Persian, Stemming",
author = "Arash Ghazvini and {Ab Aziz}, {Mohd Juzaiddin}",
year = "2012",
doi = "10.1109/ISIEA.2012.6496669",
language = "English",
isbn = "9781467330046",
pages = "50--53",
booktitle = "ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications",

}

TY - GEN

T1 - Stemming algorithm for different tenses to improve Persian dictionary

AU - Ghazvini, Arash

AU - Ab Aziz, Mohd Juzaiddin

PY - 2012

Y1 - 2012

N2 - Persian language is an Indo-European language that is known for its complexity due to the morphology structure. In this paper, we report on Persian stemmer and the impact on improvement of Persian dictionary. Persian language consists of a variety of tenses, while the focus is on past subjunctive, past perfect, continuous past, present perfect and past simple. In Persian language, it is important to get rid of affixes from the verbs to obtain the stem. Therefore, finite state machine has been chosen to develop a Persian stemmer. According to the findings and testing results, Persian stemming algorithm based dictionary is fully accurate for the regular verbs in mentioned tenses.

AB - Persian language is an Indo-European language that is known for its complexity due to the morphology structure. In this paper, we report on Persian stemmer and the impact on improvement of Persian dictionary. Persian language consists of a variety of tenses, while the focus is on past subjunctive, past perfect, continuous past, present perfect and past simple. In Persian language, it is important to get rid of affixes from the verbs to obtain the stem. Therefore, finite state machine has been chosen to develop a Persian stemmer. According to the findings and testing results, Persian stemming algorithm based dictionary is fully accurate for the regular verbs in mentioned tenses.

KW - Algorithm

KW - Dictionary

KW - Persian

KW - Stemming

UR - http://www.scopus.com/inward/record.url?scp=84876773292&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876773292&partnerID=8YFLogxK

U2 - 10.1109/ISIEA.2012.6496669

DO - 10.1109/ISIEA.2012.6496669

M3 - Conference contribution

AN - SCOPUS:84876773292

SN - 9781467330046

SP - 50

EP - 53

BT - ISIEA 2012 - 2012 IEEE Symposium on Industrial Electronics and Applications

ER -