Error-tolerant tree matching

Authors:
Kemal Oflazer
Affiliations:
Bilkent University, Ankara, Turkey
Venue:
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Year:
1996

Citing 4
Cited 1

A model and a fast algorithm for multiple errors spelling correction

Acta Informatica
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
A System for Approximate Tree Matching

IEEE Transactions on Knowledge and Data Engineering
Toward memory-based translation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3

Robust parsing using a hidden Markov model

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. 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. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.