Skip to main content
SpringerLink
Log in

Approximate Pattern Matching in Shared-Forest

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1873))

Included in the following conference series:

Abstract

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 is motivated by the study of information retrieval for textual databases, using pattern matching as a basis for querying data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kilpelainen, P., Mannila, H.: Grammatical Tree Matching. Lecture Notes in Computer Science 644 (1992) 159–171.

    Google Scholar 

  2. Kilpelainen, P.: Tree Matching Problems with Applications to Structured Text Databases. Ph.D. Thesis, Department of Computer Science, University of Helsinki, 1992. Helsinki, Finland

    Google Scholar 

  3. Smeaton, Alan F.: Incorporating Syntactic Information into a Document Retrieval Strategy: An Investigation. Proc. the 9 th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 103–113, 1986.

    Google Scholar 

  4. Smeaton, A.F. and van Rijsbergen, C.J.: Experiments on Incorporating Syntactic Processing of User Queries into a Document Retrieval Strategy. Proc. of the IIth International ACM-SIGIR Conference on Research and Development in Information Retrieval, pp. 31–54. Grenoble, France, 1988.

    Google Scholar 

  5. Smeaton, A.F and O’Donell, R. anf Kelley, F.: Indexing Structures Derived from Syntax in TREC-3: System Description. Proc. of 3rd Text REtrieval Conference (TREC-3), D.K. Harman (ed.), NIST Special Publication, 1994.

    Google Scholar 

  6. Tai, Kuo-Chung.: Syntactic error correction in programming languages. IEEE Transactions on Software Engineering 4(5) (1978) 414–425.

    MATH  Google Scholar 

  7. Vilares, M., Dion, B.A.: Efficient incremental parsing for context-free languages. Proc. of the 5th IEEE International Conference on Computer Languages (1994) 241–252, Toulouse, France.

    Google Scholar 

  8. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing (1989) 18 1245–1262.

    Article  MathSciNet  Google Scholar 

  9. Zhang, K. and Shasha, D. and Wang, J.T.L. Approximate Tree Matching in the Presence of Variable Length Donrst Cares. Journal of Algorithms, pages 33–66, vol 16(1), 1994

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Campus de Elviña s/n, 15071 A, Coruña, Spain

    F. J. Ribadas & V. M. Darriba

Authors
  1. M. Vilares
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. J. Ribadas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. M. Darriba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Mathematical Sciences, Maritime Greenwich University Campus, 30 Park Row, London, SE10 9LS, UK

    Mohamed Ibrahim

  2. University of Linz, FAW, Altenbergerstr. 69, 4040, Linz, Austria

    Josef Küng

  3. Middlesex University, Bounds Green, London, UK

    Norman Revell

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vilares, M., Ribadas, F.J., Darriba, V.M. (2000). Approximate Pattern Matching in Shared-Forest. In: Ibrahim, M., Küng, J., Revell, N. (eds) Database and Expert Systems Applications. DEXA 2000. Lecture Notes in Computer Science, vol 1873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44469-6_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44469-6_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67978-3

  • Online ISBN: 978-3-540-44469-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation