diff --git a/data/xml/2021.findings.xml b/data/xml/2021.findings.xml index 0b0d2fd8ac..c47eabd561 100644 --- a/data/xml/2021.findings.xml +++ b/data/xml/2021.findings.xml @@ -1972,7 +1972,7 @@ <fixed-case>G</fixed-case>aussian Process based Deep <fixed-case>D</fixed-case>yna-<fixed-case>Q</fixed-case> approach for Dialogue Policy Learning GuanlinWu WenqiFang - JiWang + JiWang JiangCao WeidongBao YangPing diff --git a/data/xml/K19.xml b/data/xml/K19.xml index bd138b9624..8d0fa09e1c 100644 --- a/data/xml/K19.xml +++ b/data/xml/K19.xml @@ -923,7 +923,7 @@ HaoyuZhang JingjingCai JianjunXu - JiWang + JiWang 789–797 In this paper, we propose a novel pretraining-based encoder-decoder framework, which can generate the output sequence based on the input sequence in a two-stage manner. For the encoder of our model, we encode the input sequence into context representations using BERT. For the decoder, there are two stages in our model, in the first stage, we use a Transformer-based decoder to generate a draft output sequence. In the second stage, we mask each word of the draft sequence and feed it to BERT, then by combining the input sequence and the draft representation generated by BERT, we use a Transformer-based decoder to predict the refined word for each masked position. To the best of our knowledge, our approach is the first method which applies the BERT into text generation tasks. As the first step in this direction, we evaluate our proposed method on the text summarization task. Experimental results show that our model achieves new state-of-the-art on both CNN/Daily Mail and New York Times datasets. K19-1074 diff --git a/data/xml/P19.xml b/data/xml/P19.xml index 0cdab3ee01..8cce191ab9 100644 --- a/data/xml/P19.xml +++ b/data/xml/P19.xml @@ -5642,7 +5642,7 @@ HaoyuZhang JingjingCai JianjunXu - JiWang + JiWang 4477–4486 In this work, we focus on complex question semantic parsing and propose a novel Hierarchical Semantic Parsing (HSP) method, which utilizes the decompositionality of complex questions for semantic parsing. Our model is designed within a three-stage parsing architecture based on the idea of decomposition-integration. In the first stage, we propose a question decomposer which decomposes a complex question into a sequence of sub-questions. In the second stage, we design an information extractor to derive the type and predicate information of these questions. In the last stage, we integrate the generated information from previous stages and generate a logical form for the complex question. We conduct experiments on COMPLEXWEBQUESTIONS which is a large scale complex question semantic parsing dataset, results show that our model achieves significant improvement compared to state-of-the-art methods. P19-1440 diff --git a/data/yaml/name_variants.yaml b/data/yaml/name_variants.yaml index 277227befc..85f436c6e8 100644 --- a/data/yaml/name_variants.yaml +++ b/data/yaml/name_variants.yaml @@ -10478,6 +10478,12 @@ - canonical: {first: Hsin-Min, last: Wang} variants: - {first: Hsin-min, last: Wang} +- canonical: {first: Ji, last: Wang} + comment: May refer to several people + id: ji-wang +- canonical: {first: Ji, last: Wang} + comment: NUDT + id: ji-wang-nudt - canonical: {first: JianXiang, last: Wang} variants: - {first: Jianxiang, last: Wang}