Title :
Using propositional graphs for soft information fusion
Author :
Prentice, Michael ; Shapiro, Stuart C.
Author_Institution :
Dept. of Comput. Sci. & Eng., State Univ. of New York at Buffalo, Buffalo, NY, USA
Abstract :
Soft information is information contained in natural language messages written by human informants or human intelligence gatherers. Tractor is a system that automatically processes natural language messages and represents the information extracted from them as propositional graphs. Propositional graphs have several benefits as a knowledge representation formalism for information fusion: n-ary relations may be represented as simply as binary relations; meta-information and pedigree may be represented in the same format as object-level information; they are amenable to graph matching techniques and fusion with information from other sources; they may be used by reasoning systems to draw inferences from explicitly conveyed information and relevant background information. The propositional graphs produced by Tractor are based on the FrameNet system of deep lexical semantics. A method of producing propositional graphs is proposed using dependency parse information and rules written in the SNePS knowledge representation and reasoning system.
Keywords :
graph theory; knowledge representation; natural language processing; sensor fusion; FrameNet system; Tractor; binary relations; deep lexical semantics; dependency parse information; graph matching; human informants; human intelligence gatherers; knowledge representation; meta-information; n-ary relations; natural language messages; object-level information; pedigree; propositional graphs; reasoning system; soft information fusion; Agricultural machinery; Cellular phones; Cognition; Knowledge based systems; Natural languages; Semantics; Syntactics; Hard/soft data fusion; ontologies; propositional graphs;
Conference_Titel :
Information Fusion (FUSION), 2011 Proceedings of the 14th International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4577-0267-9