64 research outputs found
Query Answering over Wikipedia for Mobile Devices on the Android Platform
p { margin-bottom: 0.1in; direction: ltr; line-height: 120%; text-align: left; widows: 2; orphans: 2; }p.western { font-family: "Times New Roman",serif; }p.cjk { font-family: "Times New Roman"; }p.ctl { font-family: "Times New Roman"; font-size: 12pt; }a:link { color: rgb(0, 0, 255); } Tato bakalářská práce se zabĂ˝vá vĂ˝vojem systĂ©mu pro inteligentnĂ dotazovánĂ Wikipedie pro mobilnĂ zaĹ™ĂzenĂ s operaÄŤnĂm systĂ©mem Android. Tato technická zpráva dále popisuje teoretickĂ© znalosti Ăşzce souvisejĂcĂ s tĂ©matem a dále je popsána implementace serverovĂ©ho systĂ©mu a klientskĂ© aplikace. Část zprávy obsahuje testovánĂ vĂ˝slednĂ©ho systĂ©mu a v závÄ›ru je nastĂnÄ›n potencionálnĂ budoucĂ vĂ˝voj.p { margin-bottom: 0.1in; direction: ltr; line-height: 120%; text-align: left; widows: 2; orphans: 2; }p.western { font-family: "Times New Roman",serif; }p.cjk { font-family: "Times New Roman"; }p.ctl { font-family: "Times New Roman"; font-size: 12pt; }a:link { color: rgb(0, 0, 255); } This bachelor thesis deals with the development of a system for query answering over Wikipedia for mobile devices running Android operating system. In this technical report theoretical knowledge related to this topic is described as well as the implementation process of a server system and client side application. Part of this thesis is dedicated to testing of the system and in the final part the potential for future development is drafted.
A Dependency-Based Neural Network for Relation Classification
Previous research on relation classification has verified the effectiveness
of using dependency shortest paths or subtrees. In this paper, we further
explore how to make full use of the combination of these dependency
information. We first propose a new structure, termed augmented dependency path
(ADP), which is composed of the shortest dependency path between two entities
and the subtrees attached to the shortest path. To exploit the semantic
representation behind the ADP structure, we develop dependency-based neural
networks (DepNN): a recursive neural network designed to model the subtrees,
and a convolutional neural network to capture the most important features on
the shortest path. Experiments on the SemEval-2010 dataset show that our
proposed method achieves state-of-art results.Comment: This preprint is the full version of a short paper accepted in the
annual meeting of the Association for Computational Linguistics (ACL) 2015
(Beijing, China
- …