Rule-based Indonesian Open Information Extraction

A. Romadhony, A. Purwarianti, D. H. Widyantoro
{"title":"Rule-based Indonesian Open Information Extraction","authors":"A. Romadhony, A. Purwarianti, D. H. Widyantoro","doi":"10.1109/ICAICTA.2018.8541293","DOIUrl":null,"url":null,"abstract":"Open Information Extraction (Open IE) is a paradigm that tries to extract as much information as possible, with less restriction on the information type to be extracted. It extracts relation tuples, in which a relation tuple consists of a relation tuple trigger and several relation arguments. Previous studies on developing Open IE systems have mainly been for English. Recently, several works have also been carried out in other languages, but there is no study on Open IE for Indonesian. In this paper, we investigate several rule-based methods for building an Open IE system for Indonesian. We use lexical and syntactic features that were obtained from an Indonesian language processing tool and compare the extraction results against the standard English Open IE systems. The experimental results for English-Indonesian parallel sentences show that the POSTag+Noun Phrase-based rules have better performance. At the same time, the dependency relation-based performance depends on the dependency parser performance, which still needs improvement since we use a small size dataset on training the parser. However, both approaches show good performance in identifying the relation tuple trigger, with the recall score being 0.96 for the POSTag+Noun Phrase-based rules and 0.6 for the POSTag+Dependency relation based-rules.","PeriodicalId":184882,"journal":{"name":"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICTA.2018.8541293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Open Information Extraction (Open IE) is a paradigm that tries to extract as much information as possible, with less restriction on the information type to be extracted. It extracts relation tuples, in which a relation tuple consists of a relation tuple trigger and several relation arguments. Previous studies on developing Open IE systems have mainly been for English. Recently, several works have also been carried out in other languages, but there is no study on Open IE for Indonesian. In this paper, we investigate several rule-based methods for building an Open IE system for Indonesian. We use lexical and syntactic features that were obtained from an Indonesian language processing tool and compare the extraction results against the standard English Open IE systems. The experimental results for English-Indonesian parallel sentences show that the POSTag+Noun Phrase-based rules have better performance. At the same time, the dependency relation-based performance depends on the dependency parser performance, which still needs improvement since we use a small size dataset on training the parser. However, both approaches show good performance in identifying the relation tuple trigger, with the recall score being 0.96 for the POSTag+Noun Phrase-based rules and 0.6 for the POSTag+Dependency relation based-rules.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于规则的印尼语公开信息提取
开放信息提取(Open Information Extraction, Open IE)是一种范式,它试图提取尽可能多的信息,对要提取的信息类型限制较少。它提取关系元组,其中关系元组由一个关系元组触发器和几个关系参数组成。以前关于开发Open IE系统的研究主要是针对英语的。最近也开展了几项其他语言的工作,但没有针对印尼语的Open IE的研究。在本文中,我们研究了几种基于规则的方法来构建一个开放的印尼IE系统。我们使用从印度尼西亚语言处理工具获得的词汇和句法特征,并将提取结果与标准英语Open IE系统进行比较。英汉-印尼语并列句的实验结果表明,基于POSTag+名词短语的规则具有更好的性能。同时,基于依赖关系的性能取决于依赖解析器的性能,由于我们使用的是小数据集来训练解析器,因此仍然需要改进。然而,这两种方法在识别关系元组触发器方面表现良好,基于POSTag+名词短语的规则的召回分数为0.96,基于POSTag+依赖关系的规则的召回分数为0.6。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Construction of dialog database for development of spoken dialog breakdown detection methods Associative Memory by Using Coupled Gaussian Maps Supplementary Book Suggestion for Computer Science Courses The Experimental Set of Light Distribution Analysis by LabView Application Online Speech Decoding Optimization Strategy with Viterbi Algorithm on GPU
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1