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

Approximate Pattern Matching in Shared-Forest

We present a proposal intended to demonstrate the applicability of tabulation techniques to pattern recognition problems, when dealing with structures sharing some common parts. This work in motivated by the study of information retrieval for textual databases, using pattern matching as a basis for querying data.

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

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

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

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

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

[5] Kaizhong Zhang,et al. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

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

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

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