Applying RST relations to semantic search

Authors:
Nguyen Thanh Tri;Akira Shimazu;Le Cuong Anh;Nguyen Minh Le
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, Ishikawa, Japan
Venue:
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
Year:
2006

Citing 4
Cited 0

DOSE: A Distributed Open Semantic Elaboration Platform

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
The rhetorical parsing of unrestricted texts: a surface-based approach

Computational Linguistics
Building a discourse-tagged corpus in the framework of Rhetorical Structure Theory

SIGDIAL '01 Proceedings of the Second SIGdial Workshop on Discourse and Dialogue - Volume 16
XSEarch: a semantic search engine for XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new way of extracting answers to some kinds of queries based on Rhetorical Structure Theory (RST) For each type of question, we assign one or more rhetorical relations that help extract the corresponding answers We use ternary expressions which are successfully applied in the well-known question answering system START to represent text segments, index documents and queries The cosine measure is used in the matching process The experiment with RST Discourse Treebank shows that the results of ternary-expression-based indexing are better than those of keyword-based indexing.