Approximately common patterns in shared-forests

Authors:
M. Vilares;F. J. Ribadas;J. Graña
Affiliations:
University of A Coruña., A Coruña, Spain;University of Vigo., Ourense, Spain;University of A Coruña., A Coruña, Spain
Venue:
Proceedings of the tenth international conference on Information and knowledge management
Year:
2001

Citing 4
Cited 1

Approximate tree matching in the presence of variable length don't cares

Journal of Algorithms
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Machine learning and data mining

Communications of the ACM
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics

Extraction of complex index terms in non-English IR: A shallow parsing based approach

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a proposal intended to demonstrate the applicability of tabulation techniques for detecting approximately common patterns when dealing with structures sharing some common parts. This sharing saves on the space needed to represent the structures and also on their later processing, by factorizing the filtering of substructure matching. As a consequence, preliminary experimental tests indicate a reduction of the running time.