Universal rewriting via machine translation
dc.contributor.advisor
Lapata, Maria
dc.contributor.advisor
Sennrich, Rico
dc.contributor.author
Mallinson, Jonathan
dc.date.accessioned
2022-01-26T16:25:56Z
dc.date.available
2022-01-26T16:25:56Z
dc.date.issued
2021-11-30
dc.description.abstract
Natural language allows for the same meaning (semantics) to be expressed in multiple different ways, i.e. paraphrasing. This thesis examines automatic approaches for paraphrasing, focusing on three paraphrasing subtasks: unconstrained paraphrasing where there are no constraints on the output, simplification, where the output must be simpler than the input, and text compression where the output must be shorter than the input.
Whilst we can learn paraphrasing from supervised data, this data is sparse and expensive to create. This thesis is concerned with the use of transfer learning to improve paraphrasing when there is no supervised data. In particular, we address the following question: can transfer learning be used to overcome a lack of paraphrasing data? To answer this question we split it into three subquestions (1) No supervised data exists for a specific paraphrasing task; can bilingual data be used as a source of training data for paraphrasing? (2) Supervised paraphrasing data exists in one language but not in another; can bilingual data be used to transfer paraphrasing training data from one language to another? (3) Can the output of encoder-decoder paraphrasing models be controlled?
en
dc.identifier.uri
https://hdl.handle.net/1842/38479
dc.identifier.uri
http://dx.doi.org/10.7488/era/1743
dc.language.iso
en
en
dc.publisher
The University of Edinburgh
en
dc.title
Universal rewriting via machine translation
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en
Files
Original bundle
1 - 1 of 1
- Name:
- MallinsonJS_2021.pdf
- Size:
- 918.48 KB
- Format:
- Adobe Portable Document Format
- Description:
This item appears in the following Collection(s)

