liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cross-Language Learning for Arabic Relation Extraction
Univ Tehran, Iran.
Univ Tehran, Iran.
Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-1942-6063
2018 (English)In: ARABIC COMPUTATIONAL LINGUISTICS, ELSEVIER SCIENCE BV , 2018, Vol. 142, p. 190-197Conference paper, Published paper (Refereed)
Abstract [en]

Relation Extraction from Arabic text is a difficult and challenging task. Pattern-based methods often employ precise and accurate linguistics rules; however, they need huge amount of manual works to annotate corpora with desired tags. On the other hand, supervised methods need large corpus with semantic tags; which in turn imposes extra load for preparing annotated data. In this paper, a cross-language method for relation extraction is proposed, which uses the training data of other languages and trains a model for relation extraction from Arabic text. The task is supervised learning, in which several lexical and syntactic features are considered. The proposed method mainly relies on the Universal Dependency (UD) parsing and the similarity of UD trees in different languages. Regarding UD parse trees, all the features for training classifiers are extracted and represented in a universal space. To incorporate different features in training the classifier, a combination of kernel functions is proposed. Result of experiments on ACE-2004 data set reveals 63.5% Fl for Arabic test data. (C) 2018 The Authors. Published by Elsevier B.V.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2018. Vol. 142, p. 190-197
Series
Procedia Computer Science, ISSN 1877-0509
Keywords [en]
Relation Extraction; Universal Dependency Parsing; Tree Kernel
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-158893DOI: 10.1016/j.procs.2018.10.475ISI: 000471263500020OAI: oai:DiVA.org:liu-158893DiVA, id: diva2:1337571
Conference
4th Annual International Conference on Arabic Computational Linguistics (ACLing)
Available from: 2019-07-16 Created: 2019-07-16 Last updated: 2019-07-16

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Maleki, Jalal
By organisation
Human-Centered systemsFaculty of Science & Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf