System for approximate tree matching

Jason Tsong Li Wang, Kaizhong Zhang, Karpjoo Jeong, Dennis Shasha

Research output: Contribution to journalArticle

Abstract

Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called Approximate-Tree-By-Example (ATBE), which allows in-exact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.

Original languageEnglish (US)
Pages (from-to)559-571
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume6
Issue number4
DOIs
StatePublished - Aug 1994

Fingerprint

Computer programming languages
Program interpreters
Molecular biology
Query languages
Taxonomies
Error correction
Glossaries
Computer programming
RNA
Pattern recognition
Labels
Semantics
Processing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

System for approximate tree matching. / Wang, Jason Tsong Li; Zhang, Kaizhong; Jeong, Karpjoo; Shasha, Dennis.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No. 4, 08.1994, p. 559-571.

Research output: Contribution to journalArticle

Wang, Jason Tsong Li ; Zhang, Kaizhong ; Jeong, Karpjoo ; Shasha, Dennis. / System for approximate tree matching. In: IEEE Transactions on Knowledge and Data Engineering. 1994 ; Vol. 6, No. 4. pp. 559-571.
@article{b090550e224f4b5a80e9172c4fb993b0,
title = "System for approximate tree matching",
abstract = "Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called Approximate-Tree-By-Example (ATBE), which allows in-exact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.",
author = "Wang, {Jason Tsong Li} and Kaizhong Zhang and Karpjoo Jeong and Dennis Shasha",
year = "1994",
month = "8",
doi = "10.1109/69.298173",
language = "English (US)",
volume = "6",
pages = "559--571",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - System for approximate tree matching

AU - Wang, Jason Tsong Li

AU - Zhang, Kaizhong

AU - Jeong, Karpjoo

AU - Shasha, Dennis

PY - 1994/8

Y1 - 1994/8

N2 - Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called Approximate-Tree-By-Example (ATBE), which allows in-exact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.

AB - Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called Approximate-Tree-By-Example (ATBE), which allows in-exact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.

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

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

U2 - 10.1109/69.298173

DO - 10.1109/69.298173

M3 - Article

AN - SCOPUS:0028485693

VL - 6

SP - 559

EP - 571

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 4

ER -