Abstract
We study the edit-distance of regular tree languages. The edit-distance is a useful metric for measuring the similarity or dissimilarity between two objects. 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 in L and a tree in R. Given tree automata for L and R, we design a polynomial time algorithm that computes d(L, R). We also present an efficient algorithm that identifies a special common string between two context-free grammars using the edit-distance between two tree languages.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
