Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.18653/v1/D19-1621 | EMNLP/IJCNLP (1) |
DocType | Volume | Citations |
Conference | D19-1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harsh Jhamtani | 1 | 19 | 6.51 |
| Sanket V. Mehta | 2 | 3 | 2.42 |
| Jaime G. Carbonell | 3 | 5019 | 724.15 |
| Taylor Berg-Kirkpatrick | 4 | 554 | 35.93 |