Arabic entity graph extraction using morphology, finite state machines, and graph transformations

5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Research on automatic recognition of named entities from Arabic text uses techniques that work well for the Latin based languages such as local grammars, statistical learning models, pattern matching, and rule-based techniques. These techniques boost their results by using application specific corpora, parallel language corpora, and morphological stemming analysis. We propose a method for extracting entities, events, and relations amongst them from Arabic text using a hierarchy of finite state machines driven by morphological features such as part of speech and gloss tags, and graph transformation algorithms. We evaluated our method on two natural language processing applications. We automated the extraction of narrators and narrator relations from several corpora of Islamic narration books. We automated the extraction of genealogical family trees from Biblical texts. In all applications, our method reports high precision and recall and learns lemmas about phrases that improve results. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Makhlouta, J., Zaraket, F., & Harkous, H. (2012). Arabic entity graph extraction using morphology, finite state machines, and graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7181 LNCS, pp. 297–310). https://doi.org/10.1007/978-3-642-28604-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free