Error-tolerant retrieval of trees

Kemal Oflazer

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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
Volume19
Issue number12
DOIs
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Retrieval
Leaves
Labels
Natural Language
Efficient Algorithms
Processing
Query

Keywords

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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Computer Vision and Pattern Recognition

Cite this

Error-tolerant retrieval of trees. / Oflazer, Kemal.

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 19, No. 12, 1997, p. 1376-1380.

Research output: Contribution to journalArticle

Oflazer, Kemal. / Error-tolerant retrieval of trees. In: IEEE Transactions on Pattern Analysis and Machine Intelligence. 1997 ; Vol. 19, No. 12. pp. 1376-1380.
@article{0dd473a3f17842ceafff9f117f0bcdf8,
title = "Error-tolerant retrieval of trees",
abstract = "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.",
keywords = "Approximate tree comparison, Example-based machine translation, Retrieval from lexical databases, Tree databases",
author = "Kemal Oflazer",
year = "1997",
doi = "10.1109/34.643897",
language = "English",
volume = "19",
pages = "1376--1380",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "12",

}

TY - JOUR

T1 - Error-tolerant retrieval of trees

AU - Oflazer, Kemal

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Approximate tree comparison

KW - Example-based machine translation

KW - Retrieval from lexical databases

KW - Tree databases

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

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

U2 - 10.1109/34.643897

DO - 10.1109/34.643897

M3 - Article

AN - SCOPUS:0031338987

VL - 19

SP - 1376

EP - 1380

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 12

ER -