Error-tolerant retrieval of trees

Kemal Oflazer

Research output: Contribution to journalArticle

12 Citations (Scopus)


We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For large randomly generated synthetic tree databases (some having tens of thousands of trees), and on databases constructed from Wall Street Journal treebank, it can retrieve for trees with a small error, in a matter of tenths of a second to about a second.

Original languageEnglish
Pages (from-to)1376-1380
Number of pages5
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number12
Publication statusPublished - 1 Dec 1997


  • Approximate tree comparison
  • Example-based machine translation
  • Retrieval from lexical databases
  • Tree databases

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Error-tolerant retrieval of trees'. Together they form a unique fingerprint.

  • Cite this