The Chinese Open Relation Extraction Based on Dependency Parsing

DOI

10.2991/fmsmt-17.2017.237How to use a DOI?

Keywords

dependency parsing,chinese relation extraction,heuristic rules,unsupervised

Abstract

Open relation extraction is one of the most promising relation extractioins.However,the precision and recall of the existing methods are far from satisfication especially for extraction from chinese text.In this paper,we propose a method based on dependency parsing, and develope a new system called C-Reverb. Specifically,we design regular expressions for relation phrase through analyzing the Chinese grammar rules.Based on statistics of a large amount of sentences ,we find the distribution between entities and relations to formulate the rules for entity identification. Afterwards, the extracted triples which lack of entities are simply filtered.The experimental results show that our method efficiently improves the precision and recall rate of Chineses relation extraction.Furthermore, relation expressions extracted by our method are more informative than the previous method.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yuzhao Wang
AU  - Yunfei Yang
AU  - Ruixue Zhao
PY  - 2017/04
DA  - 2017/04
TI  - The Chinese Open Relation Extraction Based on Dependency Parsing
BT  - Proceedings of the 2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology (FMSMT 2017)
PB  - Atlantis Press
SP  - 1212
EP  - 1216
SN  - 2352-5401
UR  - https://doi.org/10.2991/fmsmt-17.2017.237
DO  - 10.2991/fmsmt-17.2017.237
ID  - Wang2017/04
ER  -