Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligent Text Processing and Computational Linguistics

CICLing 2001: Computational Linguistics and Intelligent Text Processing pp 483–494Cite as

Approximate VLDC Pattern Matching in Shared-Forest

  • Conference paper
  • First Online:

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

Abstract

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

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Billot, S., Lang, B.: The structure of shared forest in ambiguous parsing. Proc. of 27 thAnnual Meeting of the ACL, 1989.

    Google Scholar 

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

    Google Scholar 

  3. 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 

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

    Google Scholar 

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

    Google Scholar 

  6. Smeaton, A. F, O’Donell, R. and 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 

  7. Vilares, M., Cabrero, D., Ribadas F. J.: Approximate matching in shared forest. Proc. of Sixth International Workshop on Natural Language Understanding and Logic Programming pp. 59–72, Las Cruces, NM (USA), 1999.

    Google Scholar 

  8. 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 

  9. 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 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain

    Manuel Vilares

  2. Escuela Superior de Ingeniería Informática, Universidad de Vigo, Edificio Politécnico, As Lagoas, 32004, Orense, Spain

    Francisco J. Ribadas & Victor M. Darriba

Authors
  1. Manuel Vilares
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco J. Ribadas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor M. Darriba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CIC (Centro de Investigación en Computatción IPN (Instituto Politécnico Nacional), Av. Juan Dios Bátiz s/n esq. M. Othon Mendizabal Col. Nuevo Vallejo, CP. 07738, México, Mexico

    Alexander Gelbukh (Unidad Profecional “Adolfo López Mateos”) (Unidad Profecional “Adolfo López Mateos”)

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vilares, M., Ribadas, F.J., Darriba, V.M. (2001). Approximate VLDC Pattern Matching in Shared-Forest. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2001. Lecture Notes in Computer Science, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44686-9_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-44686-9_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41687-6

  • Online ISBN: 978-3-540-44686-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation