最短的路径依赖关系提取

我们提出了一个新颖的方法来提取关系，根据观察断言之间的关系之间的两个命名实体在同一个句子1所需的信息通常是由两个实体之间的依赖关系图中的最短路径捕获。实验上提取的ACE（自动内容抽取）报纸语料表明，新的最短路径依赖内核外执行最近的做法，根据去依赖树内核顶层的关系-We present a novel approach to relation extraction, based on the observation that the information required to assert a rela-tionship between two named entities in the same sentence is typically captured by the shortest path between the two entities in the dependency graph. Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel out-performs a recent approach based on de-pendency tree kernels