基于超图分割的共指消解分析-analysis of coreference resolution based on hypergraph segmentation.docxVIP

  • 16
  • 0
  • 约3.97万字
  • 约 69页
  • 2018-05-18 发布于上海
  • 举报

基于超图分割的共指消解分析-analysis of coreference resolution based on hypergraph segmentation.docx

基于超图分割的共指消解分析-analysis of coreference resolution based on hypergraph segmentation

AbstractCoreferenceresolutionisthetaskofgroupingmentionsofentitiesintosetsso thatallmentionsinonesetrefertothesameentity.Coreferenceresolutionisan importancesubtaskofinformationextraction,hasimportantapplicationinvarvious fieldsofnaturallanguageprocessingandinformationretrieval.Mostrecentapproachestocoreferenceresolutiondividethistaskintotwostep- s:1)aclassificationprocesstodetermineswhetherapairmentionpairiscoreference ortheconfidenceofcoreferencepair;2)aclusteringprocesstogroupsmentionsinto entitiesbasedontheoutputofstep1.Inthispaper,weusethehypergraphpartition cleverlysolvethecoreferenceresolutionproblem,toavoidthethedivisionintotwo steps,butfromaglobaloptimizationperspective,resolvecoreferenceresolution.We representadocumentasahypergraph,wheretheverticesdenotementionsandthe edgesdenoterelationalfeaturesbetweenmentions.Coreferenceresolutionfromthe perspectiveofglobaloptimization,willexceedthediagramisdividedintomultipleindependentsubgraph,eachsubgraphrepresentsanentitychain.Thispaperfocusesonthreeparts:thehypergraphmodelingforcoreferencere- solution;hypergraphpartitionforcoreferenceresolution;hyperedgeweightlearning basedonunlabelcorpus.Coreferenceresolutionhypergraphmodelingismainlyconcentratedinthehyp- ergraphmodelingforcoreferenceresolution,includethehyperedgeandhyperedgeweight. We have introduced a negative connection,strongly connected,twosuperedgeconcepts,depictingthelinksbetweenentities.Weproposedtwohyperedge weightlearningmethods.Hypergraphpartitionforcoreferenceresolutionrefertoconvertcoreferencer- esolutiontohypergraphpartition.Fromthekwayhypergraphpartitionanditerator 2wayhypergraphpartitioningtosolvethecoreferenceresolutionproblem.kway hypergraphpartitionoptimizationhypergraphcuttinglossed,bymakingsurethe numberofsubgraphtodeterminethenumberofentitychain.Iterator2waypartitionII-tooptimizethetoleranceofthepartition,andgraduallysplitsubgraphtodetermine theentitychain.IntheACE05Chinesecorpus,andtraditionalmethodsprovedthe effecttivenessofourwork.Hyperedg

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档