Computer Science – Computation and Language
Scientific paper
1996-04-11
Computer Science
Computation and Language
gzipped and uuencoded postscript, 5 pages. Minor fix in one of the figures. Also available as ftp://ftp.cs.bilkent.edu.tr/pu
Scientific paper
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.
No associations
LandOfFree
Error-tolerant Tree Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Error-tolerant Tree Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-tolerant Tree Matching will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-30228