Improving the performance of the random walk model for answering complex questions

Yllias Chali, Shafiq Rayhan Joty

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

We consider the problem of answering complex questions that require inferencing and synthesizing information from multiple documents and can be seen as a kind of topicoriented, informative multi-document summarization. The stochastic, graph-based method for computing the relative importance of textual units (i.e. sentences) is very successful in generic summarization. In this method, a sentence is encoded as a vector in which each component represents the occurrence frequency (TF*IDF) of a word. However, the major limitation of the TF*IDF approach is that it only retains the frequency of the words and does not take into account the sequence, syntactic and semantic information. In this paper, we study the impact of syntactic and shallow semantic information in the graph-based method for answering complex questions.

Original languageEnglish
Title of host publicationACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference
Pages9-12
Number of pages4
Publication statusPublished - 1 Dec 2008
Externally publishedYes
Event46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT - Columbus, OH, United States
Duration: 15 Jun 200820 Jun 2008

Other

Other46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT
CountryUnited States
CityColumbus, OH
Period15/6/0820/6/08

Fingerprint

Syntactics
Semantics
semantics
performance
Complex Question
Random Walk
Syntax
Graph
Summarization
Semantic Information

ASJC Scopus subject areas

  • Language and Linguistics
  • Computer Networks and Communications
  • Linguistics and Language

Cite this

Chali, Y., & Rayhan Joty, S. (2008). Improving the performance of the random walk model for answering complex questions. In ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference (pp. 9-12)

Improving the performance of the random walk model for answering complex questions. / Chali, Yllias; Rayhan Joty, Shafiq.

ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference. 2008. p. 9-12.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chali, Y & Rayhan Joty, S 2008, Improving the performance of the random walk model for answering complex questions. in ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference. pp. 9-12, 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT, Columbus, OH, United States, 15/6/08.
Chali Y, Rayhan Joty S. Improving the performance of the random walk model for answering complex questions. In ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference. 2008. p. 9-12
Chali, Yllias ; Rayhan Joty, Shafiq. / Improving the performance of the random walk model for answering complex questions. ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference. 2008. pp. 9-12
@inproceedings{7a65a809cfb84c4d8fe668d1838ecbd7,
title = "Improving the performance of the random walk model for answering complex questions",
abstract = "We consider the problem of answering complex questions that require inferencing and synthesizing information from multiple documents and can be seen as a kind of topicoriented, informative multi-document summarization. The stochastic, graph-based method for computing the relative importance of textual units (i.e. sentences) is very successful in generic summarization. In this method, a sentence is encoded as a vector in which each component represents the occurrence frequency (TF*IDF) of a word. However, the major limitation of the TF*IDF approach is that it only retains the frequency of the words and does not take into account the sequence, syntactic and semantic information. In this paper, we study the impact of syntactic and shallow semantic information in the graph-based method for answering complex questions.",
author = "Yllias Chali and {Rayhan Joty}, Shafiq",
year = "2008",
month = "12",
day = "1",
language = "English",
isbn = "9781932432046",
pages = "9--12",
booktitle = "ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference",

}

TY - GEN

T1 - Improving the performance of the random walk model for answering complex questions

AU - Chali, Yllias

AU - Rayhan Joty, Shafiq

PY - 2008/12/1

Y1 - 2008/12/1

N2 - We consider the problem of answering complex questions that require inferencing and synthesizing information from multiple documents and can be seen as a kind of topicoriented, informative multi-document summarization. The stochastic, graph-based method for computing the relative importance of textual units (i.e. sentences) is very successful in generic summarization. In this method, a sentence is encoded as a vector in which each component represents the occurrence frequency (TF*IDF) of a word. However, the major limitation of the TF*IDF approach is that it only retains the frequency of the words and does not take into account the sequence, syntactic and semantic information. In this paper, we study the impact of syntactic and shallow semantic information in the graph-based method for answering complex questions.

AB - We consider the problem of answering complex questions that require inferencing and synthesizing information from multiple documents and can be seen as a kind of topicoriented, informative multi-document summarization. The stochastic, graph-based method for computing the relative importance of textual units (i.e. sentences) is very successful in generic summarization. In this method, a sentence is encoded as a vector in which each component represents the occurrence frequency (TF*IDF) of a word. However, the major limitation of the TF*IDF approach is that it only retains the frequency of the words and does not take into account the sequence, syntactic and semantic information. In this paper, we study the impact of syntactic and shallow semantic information in the graph-based method for answering complex questions.

UR - http://www.scopus.com/inward/record.url?scp=68349106531&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68349106531&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781932432046

SP - 9

EP - 12

BT - ACL-08: HLT - 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference

ER -