Identifying Untyped Relation Mentions in a Corpus given an Ontology.

TextGraphs-7 '12: Workshop Proceedings of TextGraphs-7 on Graph-based Methods for Natural Language Processing(2012)

引用 0|浏览20
暂无评分
摘要
In this paper we present the SDOI rmi text graph-based semi-supervised algorithm for the task for relation mention identification when the underlying concept mentions have already been identified and linked to an ontology. To overcome the lack of annotated data, we propose a labelling heuristic based on information extracted from the ontology. We evaluated the algorithm on the kdd09cma1 dataset using a leave-one-document-out framework and demonstrated an increase in F1 in performance over a co-occurrence based AllTrue baseline algorithm. An extrinsic evaluation of the predictions suggests a worthwhile precision on the more confidently predicted additions to the ontology.
更多
查看译文
关键词
AllTrue baseline algorithm,semi-supervised algorithm,SDOIrmi text,annotated data,extrinsic evaluation,labelling heuristic,leave-one-document-out framework,relation mention identification,underlying concept,worthwhile precision,untyped relation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要