Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR 1993
DOI: 10.1145/160688.160722
|View full text |Cite
|
Sign up to set email alerts
|

Retrieval from hierarchical texts by partial patterns

Abstract: Structured texts (for example dictionaries and user manuals) typically have a hierarchical (tree-like) structure. We describe a query language for retrieving information from collections of hierarchical text.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0
3

Year Published

1998
1998
2009
2009

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 47 publications
(24 citation statements)
references
References 14 publications
0
21
0
3
Order By: Relevance
“…Maruta [35,36] describes a general tree model of documents and defines pattern matching by tree-regular languages and deterministic tree automata. His work generalizes the well-known approach of [31] by capabilities to express contextual conditions on document transformations.…”
Section: Web Query Languages and Document Processingmentioning
confidence: 91%
“…Maruta [35,36] describes a general tree model of documents and defines pattern matching by tree-regular languages and deterministic tree automata. His work generalizes the well-known approach of [31] by capabilities to express contextual conditions on document transformations.…”
Section: Web Query Languages and Document Processingmentioning
confidence: 91%
“…6). Because of the order between successors of internal nodes, tree inclusion between the target tree T and the document tree may be carried out according to the approach proposed in [38] for ordered included tree of tree T and used for retrieving.…”
Section: Web Documents and Information Objectsmentioning
confidence: 99%
“…Structured text query languages take a syntactic approach instead, searching for patterns in a syntax tree. A variety of query languages of this sort have been proposed, including p-strings [GT87], Maestro [Mac91], PAT expressions [ST92], tree inclusion [KM93], Proximal Nodes [NBY95], GC-lists [CCB95], and sgrep [JK96]. Baeza-Yates and Navarro give a good survey of structured text query languages [BYN96].…”
Section: Pattern Matchingmentioning
confidence: 99%