Top-down tree edit-distance of regular tree languages

Sang Ki Ko; Yo Sub Han; Kai Salomaa

doi:10.1007/978-3-319-04921-2_38

Top-down tree edit-distance of regular tree languages

Sang Ki Ko, Yo Sub Han, Kai Salomaa

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the edit-distance d(L,R) between L and R to be the minimum edit-distance between a tree t₁ ∈ L and t₂ ∈ R, respectively. Based on tree automata for L and R, we present a polynomial algorithm that computes d(L,R). We also suggest how to use the edit-distance between two tree languages for identifying a special common string between two context-free grammars.

Original language	English
Title of host publication	Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings
Pages	466-477
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-319-04921-2_38
Publication status	Published - 2014
Event	8th International Conference on Language and Automata Theory and Applications, LATA 2014 - Madrid, Spain Duration: 2014 Mar 10 → 2014 Mar 14

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8370 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th International Conference on Language and Automata Theory and Applications, LATA 2014
Country	Spain
City	Madrid
Period	14/3/10 → 14/3/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-04921-2_38

Fingerprint Dive into the research topics of 'Top-down tree edit-distance of regular tree languages'. Together they form a unique fingerprint.

Cite this

Ko, S. K., Han, Y. S., & Salomaa, K. (2014). Top-down tree edit-distance of regular tree languages. In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings (pp. 466-477). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8370 LNCS). https://doi.org/10.1007/978-3-319-04921-2_38

@inproceedings{0b1240e254d44c8a9ea21b38ba7dadd0,

title = "Top-down tree edit-distance of regular tree languages",

abstract = "We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the edit-distance d(L,R) between L and R to be the minimum edit-distance between a tree t1 ∈ L and t2 ∈ R, respectively. Based on tree automata for L and R, we present a polynomial algorithm that computes d(L,R). We also suggest how to use the edit-distance between two tree languages for identifying a special common string between two context-free grammars.",

author = "Ko, {Sang Ki} and Han, {Yo Sub} and Kai Salomaa",

note = "Copyright: Copyright 2014 Elsevier B.V., All rights reserved.; 8th International Conference on Language and Automata Theory and Applications, LATA 2014 ; Conference date: 10-03-2014 Through 14-03-2014",

year = "2014",

doi = "10.1007/978-3-319-04921-2_38",

language = "English",

isbn = "9783319049205",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "466--477",

booktitle = "Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings",

}

Ko, SK, Han, YS & Salomaa, K 2014, Top-down tree edit-distance of regular tree languages. in Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8370 LNCS, pp. 466-477, 8th International Conference on Language and Automata Theory and Applications, LATA 2014, Madrid, Spain, 14/3/10. https://doi.org/10.1007/978-3-319-04921-2_38

Top-down tree edit-distance of regular tree languages. / Ko, Sang Ki; Han, Yo Sub; Salomaa, Kai.

Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. 2014. p. 466-477 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8370 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Top-down tree edit-distance of regular tree languages

AU - Ko, Sang Ki

AU - Han, Yo Sub

AU - Salomaa, Kai

PY - 2014

Y1 - 2014

N2 - We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the edit-distance d(L,R) between L and R to be the minimum edit-distance between a tree t1 ∈ L and t2 ∈ R, respectively. Based on tree automata for L and R, we present a polynomial algorithm that computes d(L,R). We also suggest how to use the edit-distance between two tree languages for identifying a special common string between two context-free grammars.

AB - We study the edit-distance of regular tree languages. The edit-distance is a metric for measuring the similarity or dissimilarity between two objects, and a regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar. Given two regular tree languages L and R, we define the edit-distance d(L,R) between L and R to be the minimum edit-distance between a tree t1 ∈ L and t2 ∈ R, respectively. Based on tree automata for L and R, we present a polynomial algorithm that computes d(L,R). We also suggest how to use the edit-distance between two tree languages for identifying a special common string between two context-free grammars.

UR - http://www.scopus.com/inward/record.url?scp=84898067722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898067722&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-04921-2_38

DO - 10.1007/978-3-319-04921-2_38

M3 - Conference contribution

AN - SCOPUS:84898067722

SN - 9783319049205

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 466

EP - 477

BT - Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings

T2 - 8th International Conference on Language and Automata Theory and Applications, LATA 2014

Y2 - 10 March 2014 through 14 March 2014

ER -

Ko SK, Han YS, Salomaa K. Top-down tree edit-distance of regular tree languages. In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. 2014. p. 466-477. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-04921-2_38