A recursive algorithm for open information extraction from Persian texts Online publication date: Wed, 04-Jul-2018
by Mahmoud Rahat; Alireza Talebpour; Seyedamin Monemian
International Journal of Computer Applications in Technology (IJCAT), Vol. 57, No. 3, 2018
Abstract: With the proliferation of textual data accessible in the internet, researchers have focused on shifting Open Information Extraction (Open IE) paradigm to non-English languages. The process of adapting an Open IE system from English to Persian is challenging since two languages have fundamental differences in syntax and dependency representation trees. To the best of our knowledge, this article is the first published paper about Open IE for Persian. Many traditional systems apply a large set of lexical patterns which is inefficient in out-of-domain text. We replace this large pattern set with a few syntactic rules defined upon dependency parse of a sentence that are specifically designed for Persian. We also addressed some Persian-specific phenomena to enhance the results. The recursive nature of the algorithm enabled us to handle nested sentences. Our experiments showed that the proposed system achieves decent performance compared to the state of the art systems in English.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook