상세 보기
S<SUP>2</SUP>-Net: Machine reading comprehension with SRU-based self-matching networks
- Park, Cheoneum;
- Lee, Changki;
- Hong, Lynn;
- Hwang, Yigyu;
- Yoo, Taejoon;
- 외 4명
WEB OF SCIENCE
21SCOPUS
28초록
Machine reading comprehension is the task of understanding a given context and finding the correct response in that context. A simple recurrent unit (SRU) is a model that solves the vanishing gradient problem in a recurrent neural network (RNN) using a neural gate, such as a gated recurrent unit (GRU) and long short-term memory (LSTM); moreover, it removes the previous hidden state from the input gate to improve the speed compared to GRU and LSTM. A self-matching network, used in R-Net, can have a similar effect to coreference resolution because the self-matching network can obtain context information of a similar meaning by calculating the attention weight for its own RNN sequence. In this paper, we construct a dataset for Korean machine reading comprehension and propose an S-2-Net model that adds a self-matching layer to an encoder RNN using multilayer SRU. The experimental results show that the proposed S-2-Net model has performance of single 68.82% EM and 81.25% F1, and ensemble 70.81% EM, 82.48% F1 in the Korean machine reading comprehension test dataset, and has single 71.30% EM and 80.37% F1 and ensemble 73.29% EM and 81.54% F1 performance in the SQuAD dev dataset.
키워드
- 제목
- S<SUP>2</SUP>-Net: Machine reading comprehension with SRU-based self-matching networks
- 저자
- Park, Cheoneum; Lee, Changki; Hong, Lynn; Hwang, Yigyu; Yoo, Taejoon; Tang, Jaeyong; Hone, Yunki; Bae, Kyung-Hoon; Kim, Hyun-Ki
- 발행일
- 2019-06
- 유형
- Article
- 저널명
- ETRI Journal
- 권
- 41
- 호
- 3
- 페이지
- 371 ~ 382