Abstract
This paper picks up the Tree Matching approach to integrate the paradigm of structured documents into the field of Information Retrieval. The concept of Tree Matching is extended by the notion of complete answer representations (CARs), which makes it possible to avoid the combinatorial explosion in the number of solutions (and thus complexity). An algorithm is presented that combines a class of Tree Matching problems with index-based search and returns a CAR in linear time.
Cite
CITATION STYLE
Meuss, H. (1998). Indexed tree matching with complete answer representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1481, pp. 104–115). Springer Verlag. https://doi.org/10.1007/3-540-49654-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
