Aligning semantic graphs for textual inference and machine reading
- 格式:pdf
- 大小:79.60 KB
- 文档页数:7
Aligningsemanticgraphsfortextualinferenceandmachinereading
Marie-CatherinedeMarneffe,TrondGrenager,BillMacCartney,DanielCer,
DanielRamage,Chlo´eKiddon,ChristopherD.Manning
{mcdm,grenager,wcmac,cerd,dramage,loeki,manning}@stanford.edu
Abstract
Thispaperpresentsourworkontextualinferenceandsituatesitwithinthecontextofthelargergoalsofma-chinereading.Thetextualinferencetaskistodeter-mineifthemeaningofonetextcanbeinferredfromthemeaningofanotherandfrombackgroundknowledge.Oursystemgeneratessemanticgraphsasarepresenta-tionofthemeaningofatext.Thispaperpresentsnewresultsforaligningpairsofsemanticgraphs,andpro-posestheapplicationofnaturallogictoderiveinfer-encedecisionsfromthosealignedpairs.Weconsiderthisworkasfirststepstowardasystemabletodemon-stratebroad-coveragetextunderstandingandlearningabilities.
Introduction
Thispaperoutlinessomeofourrecentworkonthetaskof
robusttextualinference,whereinsystemsaimtodetermine
whetherahypothesistextfollowsfromanothertextandgen-
eralbackgroundknowledge.Inparticular,itfocusesonim-
provingalignmentsbetweenthetwotextsandapplyingideas
fromnaturallogictoinference.Butbeyondthat,itoutlines
waysinwhichsuchworkrelatestothemoregeneralgoals
ofmachinereading.
Inordertounderstandtexts,amachinereadingsystem
mustprovide(1)facilitiesforextractingmeaningfromnat-
urallanguagetext,(2)asemanticrepresentationlanguage,
forstoringmeaningsinternally,and(3)facilitiesforwork-
ingwithstoredmeanings,toanswerquestionsortoderive
furtherconsequences.Wealsowantsuchasystemtobe
robustandopen-domain,andtodegradegracefullyinthe
presenceofsemanticrepresentationswhichmaybeincom-
plete,inaccurate,orincomprehensible.Traditionalknowl-
edgerepresentation&reasoningapproaches(KR&R)failin
thatrespectbecausetheyuselambdacalculuscomposition
formeaningextraction,firstorderlogicformeaningrepre-
sentation,andtheoremproversforinference.Attheother
extreme,traditionalinformationextraction(IE)systemsgo
straightfrominputtooutputwithoutanyinternalrepresenta-
tionofsemantics,oftenseverelylimitingtypesofsemantic
relationstheycanunderstand.Aneffectivesystemmustac-
1http://jeremy.zawodny.com/blog/archives/000765.htmlrose
sales
Mitsubishipercent
46nsubjdobj
nnnum
Figure1:Typeddependencytreefor“Mitsubishisalesrose
46percent”.
drawnfromtexts.
Textualinferencesystemdescription
Thetextualinferencetaskfirstappearedlatentwithinthe
fieldofquestionanswering(Pasca&Harabagiu2001;
Moldovanetal.2003),andthenreceivedfocuswithinthe
PASCALRecognizingTextualEntailment(RTE)Challenge
(Dagan,Glickman,&Magnini2005;Bar-Haimetal.2006),
andrelatedworkwithintheU.S.GovernmentAQUAINT
program.
Ourtextualinferencesystememploysathree-stagearchi-
tectureinwhichalignmentandentailmentdeterminationare
twoseparatephases,precededbyalinguisticanalysis.The
alignmentphaseaimstoassessthecongruitybetweenthe
hypothesisHandthetextT,i.e.,howwellHcanbeem-
beddedwithinT.Althoughearlyworkontextualinference
basedtheentailmentdecisionsolelyonthequalityofthe
alignment,wehavefoundthattheexistenceofnegation,in-
tensionalcontexts,andothercommonlinguisticphenomena
makealignmentqualityanunreliableindicatorofinferra-
bility.Considerthefollowinghypothesisandtext:Arafat
targetedforassassinationandSharondeniesArafatistar-
getedforassassination.Thehypothesisgraphiscompletely
embeddedinthetextgraph,butitwouldbeincorrecttocon-
cludethatthereisentailment.Toremedythis,inthethird
phaseofourtextualinferencesystemweexaminehigh-level
semanticfeaturesoftheproposedgraphalignment,includ-
ingindicatorsofsuchphenomena,tomaketheentailment
decision.
Linguisticanalysisphase.Thegoalofthisfirststageisto
createforbothtextandhypothesissemanticgraphs,which
canbeviewedasstructuredlinguisticrepresentationsthat
containasmuchinformationaspossibleaboutsemanticcon-
tent.Asbasisforthesemanticgraph,weusetypeddepen-
dencygraphs,inwhicheachnodeisawordandlabeled
edgesrepresentgrammaticalrelationsbetweenwords.Fig-
ure1givesthetypeddependencygraphforthesentence
Mitsubishisalesrose46percent.Thesemanticgraphfor
asentencecontainsthusanodeforeachwordofthesen-
tence,eachnodebeingembellishedwithmetadatagenerated
byatoolkitoflinguisticprocessingtools,includingword
lemmas,partofspeechtags,canonicalizationofquantita-
tiveexpressions,andnamedentityrecognition.Thegraphrose→fellsales→salesMitsubishi→MitsubishiCorp.percent→percent46→46
Alignmentscore:-0.8962
Figure2:AlignmentfortheMitsubishiexample.
alsocontainslabelededgesofmultipletypes.Chiefamong
thesearethedirectededgesrepresentingthegrammaticalre-
lations.Thesearederivedusingasetofdeterministichand-
codedrulesdefiningpatternsovertheparsertree(deMarn-
effe,MacCartney,&Manning2006),outputbytheStanford
parser(Klein&Manning2003).Toensurecorrectparsing,
wepreprocessthesentencestocollapsenamedentitiesand