论文信息 - Approximate VLDC Pattern Matching in Shared-Forest

Approximate VLDC Pattern Matching in Shared-Forest

We present a matching-based proposal intended to deal with querying for structured text databases. Our approach extends approximate VLDC matching techniques by allowing a query to exploit sharing of common parts between patterns used to index the document.

Manuel Vilares Ferro | Victor M. Darriba | Francisco J. Ribadas

[1] Alan F. Smeaton,et al. Indexing Structures Derived from Syntax in TREC-3: System Description , 1994, TREC.

[2] Bernard Lang,et al. The Structure of Shared Forests in Ambiguous Parsing , 1989, ACL.

[3] Manuel Vilares Ferro,et al. Efficient incremental parsing for context-free languages , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).

[4] Heikki Mannila,et al. Grammatical Tree Matching , 1992, CPM.

[5] Kaizhong Zhang,et al. New algorithms for editing distance between trees , 1989 .

[6] Alan F. Smeaton,et al. Incorporating syntactic information into a document retrieval strategy: an investigation , 1986, SIGIR '86.

[7] Kaizhong Zhang,et al. Approximate Tree Matching in the Presence of Variable Length Don't Cares , 1994, J. Algorithms.

[8] Kuo-Chung Tai,et al. Syntactic Error Correction in Programming Languages , 1978, IEEE Trans. Software Eng..

[9] Alan F. Smeaton,et al. Experiments on incorporating syntactic processing of user queries into a document retrieval strategy , 1988, SIGIR '88.

[10] Pekka Kilpeläinen,et al. Tree Matching Problems with Applications to Structured Text Databases , 2022 .