Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings(<Special Section>Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• The issues of comparing the similarity or dissimilarity (distance) between structures have been studied. Especially, several distances between trees and their efficient algorithms have been proposed. However, all of the tree distances are defined based on mapping between vertices only, and they are helpless to compare the tree structures whose vertices and edges hold information. In this paper, we will propose a mapping between rooted and unordered trees based on vertex translation and edge translation, and then define a distance based on proposed mapping, and develop an efficient algorithm for computing proposed distance. Proposed distance can be used to compare the similarity or distance between two natural language sentences.

• 社団法人電子情報通信学会の論文
• 2004-05-01

著者

• Liu Shaoming

  Corporate Research Group Fuji Xerox Co. Ltd.

関連論文

• Distance between Rooted and Unordered Trees Based on Vertex and Edge Mappings(Discrete Mathematics and Its Applications)

スポンサーリンク