![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Keya Li Hang Cui , Renxu Sun , Keya Li, Min-Yen Kan , Tat-Seng Chua : Question answering passage retrieval using dependency relations. SIGIR 2005 : 400-407 Renxu Sun , Hang Cui , Keya Li, Min-Yen Kan , Tat-Seng Chua : Dependency relation matching for answer selection. SIGIR 2005 : 651-652 1 [ 1 ] [ 2 ] 2 [ 1 ] [ 2 ] 3 [ 1 ] [ 2 ] 4 [ 1 ] [ 2 ] ![]() ©2006 Association for Computing Machinery |