Proceedings of the 2012 National Conference on Information Technology and Computer Science

A Graph-Based Text Similarity Algorithm

Authors
Zuoguo Liu, Xiaorong Chen
Corresponding Author
Zuoguo Liu
Available Online November 2012.
DOI
https://doi.org/10.2991/citcs.2012.234How to use a DOI?
Keywords
graph theory; mapped graph; maximum common subgraph
Abstract
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 edges. The 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 similarity. Each part is calculated respectively and text similarity is the sum of two parts.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2012 National Conference on Information Technology and Computer Science
Part of series
Advances in Intelligent Systems Research
Publication Date
November 2012
ISBN
978-94-91216-39-8
ISSN
1951-6851
DOI
https://doi.org/10.2991/citcs.2012.234How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Zuoguo Liu
AU  - Xiaorong Chen
PY  - 2012/11
DA  - 2012/11
TI  - A Graph-Based Text Similarity Algorithm
BT  - 2012 National Conference on Information Technology and Computer Science
PB  - Atlantis Press
SP  - 921
EP  - 924
SN  - 1951-6851
UR  - https://doi.org/10.2991/citcs.2012.234
DO  - https://doi.org/10.2991/citcs.2012.234
ID  - Liu2012/11
ER  -