Temporally Biased Search Result Snippets
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Wright State University / OhioLINK
2015
|
| Subjects: | |
| Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=wright1441053948 |
| id |
ndltd-OhioLink-oai-etd.ohiolink.edu-wright1441053948 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-wright14410539482021-08-03T06:33:15Z Temporally Biased Search Result Snippets Tatineni, J. Abhiram Computer Science computer science The search engine result snippets are an important source of information for the user to obtain quick insights into the corresponding result documents. When the search terms are too general, like a person’s name or a company’s name, creating an appropriate snippet that effectively summarizes the document’s content can be challenging owing to multiple occurrences of the search term in the top ranked documents, without a simple means to select a subset of sentences containing them to form result snippet.In web pages classified as narratives and news articles, multiple references to explicit, implicit and relative temporal expressions can be found. Based on these expressions, the sentences can be ordered on a timeline.In this thesis, we propose the idea of generation of an alternate search results snippet, by exploiting these temporal expressions embedded within the pages, using a timeline map. Our method of snippets generation is mainly targeted at general search terms. At present, when the search terms are too general, the existing systems generate static snippets for resultant pages like displaying the first line. In our approach, we introduce an alternate method of extracting and selecting temporal data from these pages to adapt a snippet to be a more effective summary. Specifically, it selects and blends “temporally interesting” sentences. Using weighted kappa measure, we evaluate our approach by comparing snippets generated for multiple search terms based on existing systems and snippets generated by using our approach. 2015-09-09 English text Wright State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=wright1441053948 http://rave.ohiolink.edu/etdc/view?acc_num=wright1441053948 unrestricted This thesis or dissertation is protected by copyright: some rights reserved. It is licensed for use under a Creative Commons license. Specific terms and permissions are available from this document's record in the OhioLINK ETD Center. |
| collection |
NDLTD |
| language |
English |
| sources |
NDLTD |
| topic |
Computer Science computer science |
| spellingShingle |
Computer Science computer science Tatineni, J. Abhiram Temporally Biased Search Result Snippets |
| author |
Tatineni, J. Abhiram |
| author_facet |
Tatineni, J. Abhiram |
| author_sort |
Tatineni, J. Abhiram |
| title |
Temporally Biased Search Result Snippets |
| title_short |
Temporally Biased Search Result Snippets |
| title_full |
Temporally Biased Search Result Snippets |
| title_fullStr |
Temporally Biased Search Result Snippets |
| title_full_unstemmed |
Temporally Biased Search Result Snippets |
| title_sort |
temporally biased search result snippets |
| publisher |
Wright State University / OhioLINK |
| publishDate |
2015 |
| url |
http://rave.ohiolink.edu/etdc/view?acc_num=wright1441053948 |
| work_keys_str_mv |
AT tatinenijabhiram temporallybiasedsearchresultsnippets |
| _version_ |
1719439203584966656 |