arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.06743cs.CLcs.LG
收藏

使用结构化对手学习押韵约束

Learning Rhyming Constraints using Structured Adversaries

Carnegie Mellon University(卡内基梅隆大学);University of California San Diego(加利福尼亚大学圣迭戈分校)

Harsh Jhamtani, Sanket Vaibhav Mehta, Jaime Carbonell, Taylor Berg-Kirkpatrick

摘要:

现有的递归神经语言模型往往无法捕捉文本中存在的更高层次的结构:例如,诗歌中存在的押韵模式。许多关于诗歌生成的先前工作使用手动定义的约束,这些约束在解码期间使用专门的解码过程或拒绝采样来满足。押韵约束本身通常不被生成器学习。我们提出了一种替代方法,使用结构化的语法来学习诗歌生成器,该生成器直接捕获生成对抗设置中的押韵约束。该方法仅基于学习到的行尾词对的相似性矩阵来比较诗歌,从而能够成功地学习两个不同英语诗歌数据集(十四行诗和利默里克)中的押韵模式,而无需明确提供任何语音信息。

英文摘要:

Existing recurrent neural language models often fail to capture higher-level structure present in text: for example, rhyming patterns present in poetry. Much prior work on poetry generation uses manually defined constraints which are satisfied during decoding using either specialized decoding procedures or rejection sampling. The rhyming constraints themselves are typically not learned by the generator. We propose an alternate approach that uses a structured discriminator to learn a poetry generator that directly captures rhyming constraints in a generative adversarial setup. By causing the discriminator to compare poems based only on a learned similarity matrix of pairs of line ending words, the proposed approach is able to successfully learn rhyming patterns in two different English poetry datasets (Sonnet and Limerick) without explicitly being provided with any phonetic information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑