首页> 外文会议>Workshop on argumentation mining >Conditional Random Fields for Identifying Appropriate Types of Support for Propositions in Online User Comments
【24h】

Conditional Random Fields for Identifying Appropriate Types of Support for Propositions in Online User Comments

机译:有条件的随机字段,用于识别在线用户评论中的命题中的适当类型的支持

获取原文

摘要

Park and Cardie (2014) proposed a novel task of automatically identifying appropriate types of support for propositions comprising online user comments, as an essential step toward automated analysis of the adequacy of supporting information. While multiclass Support Vector Machines (SVMs) proved to work reasonably well, they do not exploit the sequential nature of the problem: For instance, verifiable experiential propositions tend to appear together, because a personal narrative typically spans multiple propositions. According to our experiments, however, Conditional Random Fields (CRFs) degrade the overall performance, and we discuss potential fixes to this problem. Nonetheless, we observe that the F_1 score with respect to the unver-ifiable proposition class is increased. Also, semi-supervised CRFs with posterior regular-ization trained on 75% labeled training data can closely match the performance of a supervised CRF trained on the same training data with the remaining 25% labeled as well.
机译:公园和Cardie(2014)提出了一种自动识别适当类型的,其包括在线用户评论命题支持一种新型的任务,因为朝向支持信息的充分的自动化分析的重要步骤。尽管多类支持向量机(SVM)被证明的工作相当不错,他们不剥削问题的顺序性:例如,可核查的经验命题往往一起出现,因为个人的叙述通常跨越多个命题。根据我们的实验,然而,条件随机域(控释肥)降低整体性能,我们讨论潜在的修复这个问题。但是,我们观察到F_1比分关于昂弗-ifiable命题类增加。此外,后路常规化半监督控释肥培训了75%标记的训练数据可以训练的对相同的训练数据进行标记以及剩余的25%有监督的CRF的性能密切配合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号