Abstrakt
In this paper we propose an alternative keyword search mechanism for Wikipedia, designed as a prototype solution towards factoid questions answering. The method considers relations between articles for finding the best matching article. Unlike the standard Wikipedia search engine and also Google engine, which search the articles content independently, requiring the entire query to be satisfied by a single article, the proposed system is intended to solve queries by employing information contained in multiple articles. Although still a keyword search, the method can be further employed in natural language questions answering, when accompanied with a question processing module. The method assumes that queries are formulated in a form of a list of Wikipedia articles. The possible solutions are then evaluated, however not by attempting to understand the meaning of the text, but by a simple method of estimating the distance between articles by measuring articles’ references or appearances in other articles, leading finally to returning a single article as an answer for the query.
Autorzy (2)
Cytuj jako
Pełna treść
- Wersja publikacji
- Accepted albo Published Version
- Licencja
- otwiera się w nowej karcie
Słowa kluczowe
Informacje szczegółowe
- Kategoria:
- Publikacja w czasopiśmie
- Typ:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Opublikowano w:
-
International Journal of Innovative Research in Computer and Communication Engineering
nr 2,
wydanie 9,
strony 5601 - 5605,
ISSN: 2320-9798 - Język:
- angielski
- Rok wydania:
- 2014
- Opis bibliograficzny:
- Brzeski A., Boiński T.: Relation-based Wikipedia Search System for Factoid Questions Answering// International Journal of Innovative Research in Computer and Communication Engineering. -Vol. 2., iss. 9 (2014), s.5601-5605
- Weryfikacja:
- Politechnika Gdańska
wyświetlono 85 razy