Query expansion techniques for question answering
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/27083 |
| _version_ | 1811085260822151168 |
|---|---|
| author | Bilotti, Matthew W. (Matthew William), 1981- |
| author2 | Boris Katz. |
| author_facet | Boris Katz. Bilotti, Matthew W. (Matthew William), 1981- |
| author_sort | Bilotti, Matthew W. (Matthew William), 1981- |
| collection | MIT |
| description | Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. |
| first_indexed | 2024-09-23T13:06:08Z |
| format | Thesis |
| id | mit-1721.1/27083 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:06:08Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/270832019-04-10T08:35:39Z Query expansion techniques for question answering Bilotti, Matthew W. (Matthew William), 1981- Boris Katz. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. Includes bibliographical references (p. 105-109). Query expansion is a technique used to boost performance of a document retrieval engine, such as those commonly found in question answering (QA) systems. Common methods of query expansion for Boolean keyword-based document retrieval engines include inserting query terms, such as alternate inflectional or derivational forms generated from existing query terms, or dropping query terms that are, for example, deemed to be too restrictive. In this thesis, I present a quantitative evaluation against a test; collection of my own design of five query expansion techniques, two term expansion methods and three term-dropping strategies. I present results that show that there exist best-performing query expansion algorithms that can be ex- perimentally optimized for specific tasks. My findings pose questions that suggest interesting avenues for further study of query expansion algorithms. by Matthew W. Bilotti. M.Eng. 2005-09-06T21:39:24Z 2005-09-06T21:39:24Z 2004 2004 Thesis http://hdl.handle.net/1721.1/27083 56820766 en_US M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 109 p. 5751699 bytes 5764839 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Bilotti, Matthew W. (Matthew William), 1981- Query expansion techniques for question answering |
| title | Query expansion techniques for question answering |
| title_full | Query expansion techniques for question answering |
| title_fullStr | Query expansion techniques for question answering |
| title_full_unstemmed | Query expansion techniques for question answering |
| title_short | Query expansion techniques for question answering |
| title_sort | query expansion techniques for question answering |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/27083 |
| work_keys_str_mv | AT bilottimatthewwmatthewwilliam1981 queryexpansiontechniquesforquestionanswering |