Our proposed approach measures the similarity between two textual documents by representing them as graphs-of-words, transforming these graphs into other graphs, and using graph kernels to calculate the similarity of the new graphs.
we capitalize on the shortest-path graph kernel  and we modify it to compare the graph representations of pairs of documents.