M. Vilares, F.J. Ribadas, V.M. Darriba  Home/Search
Context Related
| coleweb.dc.fi.udc....lRibDar2001a.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: coleweb.dc.fi.udc....publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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. (Update)
Cited by: More
On Pattern-Matching as Query Facility - Vilares Ribadas And (2004) (Correct)
Similar documents (at the sentence level):
35.5%: Pattern Matching as a Dynamic Facility to get Aboutness - Vilares, Ribadas, Darriba (2000) (Correct)
26.0%: Approximate Pattern Matching in Shared-Forest - M.Vilares, Ribadas, V.M.Darriba (2000) (Correct)
9.4%: On Integration of Parsing and Tree Matching Schemes - Ferro, Souto, Pena (2000) (Correct)
Active bibliography (related documents): More All
0.3: Content-Based Text Retrieval - An Experiment in Variable-Depth NLP - Hess (Correct)
0.2: A Probabilistic Learning Approach for Document Indexing - Fuhr, Buckley (1991) (Correct)
0.2: An Approach to Natural Language Processing for Document Retrieval - Croft, Lewis (1996) (Correct)
Similar documents based on text: More All
0.7: A Proposal on Error Repair - Vilares, Darriba, Ribadas (2000) (Correct)
0.6: Regional Least-Cost Error Repair - Vilares, Darriba, Ribadas (2000) (Correct)
0.6: A Formal Frame for Robust Parsing - Vilares Darriba Vilares (2004) (Correct)
BibTeX entry: (Update)
M. Vilares, F.J. Ribadas, and V.M. Darriba. Approximate vldc pattern matching in shared-forest. Lecture Notes in Arti cial Intelligence, 2004:483-494, 2001. http://citeseer.ist.psu.edu/vilares01approximate.html More
@article{ vilares01approximate,
author = "Manuel Vilares and Francisco J. Ribadas and Victor M. Darriba",
title = "Approximate {VLDC} Pattern Matching in Shared-Forest",
journal = "Lecture Notes in Computer Science",
volume = "2004",
pages = "483--??",
year = "2001",
url = "citeseer.ist.psu.edu/vilares01approximate.html" }
Citations (may not include all citations):76 Simple fast algorithms for the editing distance between tree.. (context) - Zhang, Shasha - 1989
47 The structure of shared forest in ambiguous parsing - Billot, Lang - 1989
32 Tree Matching Problems with Applications to Structured Text .. - Kilpelainen - 1992
23 Approximate Tree Matching in the Presence of Variable Length.. - Zhang, Shasha et al. - 1994
9 Experiments on Incorporating Syntactic Processing of User Qu.. (context) - Smeaton, van Rijsbergen - 1988
8 Ecient incremental parsing for context-free languages (context) - Vilares, Dion - 1994
6 Indexing Structures Derived from Syntax in TREC-3: System De.. - Smeaton, O'Donell et al. - 1994
5 Incorporating Syntactic Information into a Document Retrieva.. (context) - Alan - 1986
3 Lecture Notes in Computer Science (context) - Kilpelainen, Mannila - 1992
1 of Sixth International Workshop on Natural Language Understa.. (context) - Vilares, Cabrero et al. - 1999
Documents on the same site (http://coleweb.dc.fi.udc.es/cole/publications.html): More
Dynamic Programming as Frame for Efficient Parsing - Ferro, Souto, al. (1998) (Correct)
A tabular interpretation of a class of 2-Stack Automata - Clergerie, Pardo (1998) (Correct)
A Comparison for Unification-Based Parsers - Ferro, Souto, Pardo (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC