Un due probabiliste pour départager deux présidents(LIA@DEFT '2005)
Un duel probabiliste pour départager deux présidents (LIA @ DEFT'2005)
摘要:
我们提出了一套适用于二进制分类的概率模型定义的DEFT '05挑战。这个挑战包含了自然语言处理中两个不同的问题:作者的识别(弗朗索瓦·密特朗的一系列句子可能被插入到雅克·希拉克的演讲中)和主题中断检测(两位作者所讨论的主题应该是不同的)。马尔可夫链,贝叶斯模型和自适应过程已被用来确定这些序列的亲子关系。一个概率模型的内部连贯的讲话,已被用来识别主位中断。添加此模型已证明可以提高质量结果。不同方法的比较表明,结合学习,一致性和适应性的战略的优越性。应用于DEFT '05数据测试,在精确度(0.890),召回率(0.955)和Fscore(0.925)方面的结果是非常有希望的。
英文摘要:
We present a set of probabilistic models applied to binary classification as defined in the DEFT'05 challenge. The challenge consisted a mixture of two differents problems in Natural Language Processing : identification of author (a sequence of François Mitterrand's sentences might have been inserted into a speech of Jacques Chirac) and thematic break detection (the subjects addressed by the two authors are supposed to be different). Markov chains, Bayes models and an adaptative process have been used to identify the paternity of these sequences. A probabilistic model of the internal coherence of speeches which has been employed to identify thematic breaks. Adding this model has shown to improve the quality results. A comparison with different approaches demostrates the superiority of a strategy that combines learning, coherence and adaptation. Applied to the DEFT'05 data test the results in terms of precision (0.890), recall (0.955) and Fscore (0.925) measure are very promising.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。