A Graph-Based Text Similarity Algorithm

作     者：Zuoguo Liu College of Computer Science & Information GuiZhou University GuiYang city,GuiZhou province,China Xiaorong Chen College of Computer Science & Information GuiZhou University GuiYang city,GuiZhou province,China 

会议名称：《2012 National Conference on Information Technology and Computer Science》

会议日期：2012年

学科分类：081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：GuiZhou provincial industry and informatization development special fund(20119133) 

关 键 词：graph theory mapped graph maximum common subgraph 

摘      要：This paper is trying to research a text similarity algorithm which based on graph theory.A text is mapped into a graph which consists of terms as its nodes and term sequences as its undirected *** Maximum Common Subgraph （MCS） of two graphs is useful for analyzing their similarity and the similarity of two texts is divided into two parts:nodes similarity and edges *** part is calculated respectively and text similarity is the sum of two parts.