{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/109448"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/109448","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Persuasiveness of text messages generated by machine learning language model","abstract":"The objective of this study is to examine the effectiveness of our algorithm that applies a machine learning language model to convert the message to be memorable and persuasive. We designed an algorithm that takes an input sentence, and by changing the sentence to be more general in the syntax level, and more distinctive at the lexical level with the masked language model, we will convert the input sentence to be more memorable and more effective at persuading people to change their attitude. We came up with two versions of the algorithm that have a slight difference of focus on the attributes of the output sentences, and we designed an experiment in Mechanical Turk to compare these two versions of the algorithm. In this study, we first introduce an algorithm that is consisted mainly of two steps. First, the algorithm will convert an input text message to be more general at the level of sentence structure, then the algorithm will compose a sentence with more distinctive words. We created two versions of the algorithm that have their advantages: one version of the algorithm focus on replacing original words with distinctive synonymous, thus keeping the original meaning of the input sentence during the generation process; the other version focuses on replacing words with more distinctive vocabularies, not only restricted to synonyms, thus making the sentence with more variations for vocabularies and more memorable to readers. To compare these two versions of an algorithm for their effectiveness at converting a sentence to be more memorable and more persuasive, we experimented on Mechanical Turk. Our experiment results show that sentences with more general sentence structure and more distinctive words contribute to memorability and persuasiveness of sentences, but the results also suggest several improvements should be made for the algorithms.","abstract_html":"The objective of this study is to examine the effectiveness of our algorithm that applies a machine learning language model to convert the message to be memorable and persuasive. We designed an algorithm that takes an input sentence, and by changing the sentence to be more general in the syntax level, and more distinctive at the lexical level with the masked language model, we will convert the input sentence to be more memorable and more effective at persuading people to change their attitude. We came up with two versions of the algorithm that have a slight difference of focus on the attributes of the output sentences, and we designed an experiment in Mechanical Turk to compare these two versions of the algorithm. In this study, we first introduce an algorithm that is consisted mainly of two steps. First, the algorithm will convert an input text message to be more general at the level of sentence structure, then the algorithm will compose a sentence with more distinctive words. We created two versions of the algorithm that have their advantages: one version of the algorithm focus on replacing original words with distinctive synonymous, thus keeping the original meaning of the input sentence during the generation process; the other version focuses on replacing words with more distinctive vocabularies, not only restricted to synonyms, thus making the sentence with more variations for vocabularies and more memorable to readers. To compare these two versions of an algorithm for their effectiveness at converting a sentence to be more memorable and more persuasive, we experimented on Mechanical Turk. Our experiment results show that sentences with more general sentence structure and more distinctive words contribute to memorability and persuasiveness of sentences, but the results also suggest several improvements should be made for the algorithms.","abstract_has_math":false,"creators":["Zheng, Bo"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Sundaram, Hari"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-03-05T21:38:23Z","date_published":"2021-03-05T21:38:23Z","updated_at":"2026-07-22T22:24:50Z","subjects":["persuasive message generation","machine learning"],"languages":["en"],"rights":["Copyright 2020 Bo Zheng"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/109448","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sundaram, Hari"]},{"key":"dc:creator","label":"Author","values":["Zheng, Bo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2021-03-05T21:38:23Z","2020-12-09","2020-12"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["persuasive message generation","machine learning"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2020 Bo Zheng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/109448"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The objective of this study is to examine the effectiveness of our algorithm that applies a machine learning language model to convert the message to be memorable and persuasive. We designed an algorithm that takes an input sentence, and by changing the sentence to be more general in the syntax level, and more distinctive at the lexical level with the masked language model, we will convert the input sentence to be more memorable and more effective at persuading people to change their attitude. We came up with two versions of the algorithm that have a slight difference of focus on the attributes of the output sentences, and we designed an experiment in Mechanical Turk to compare these two versions of the algorithm. In this study, we first introduce an algorithm that is consisted mainly of two steps. First, the algorithm will convert an input text message to be more general at the level of sentence structure, then the algorithm will compose a sentence with more distinctive words. We created two versions of the algorithm that have their advantages: one version of the algorithm focus on replacing original words with distinctive synonymous, thus keeping the original meaning of the input sentence during the generation process; the other version focuses on replacing words with more distinctive vocabularies, not only restricted to synonyms, thus making the sentence with more variations for vocabularies and more memorable to readers. To compare these two versions of an algorithm for their effectiveness at converting a sentence to be more memorable and more persuasive, we experimented on Mechanical Turk. Our experiment results show that sentences with more general sentence structure and more distinctive words contribute to memorability and persuasiveness of sentences, but the results also suggest several improvements should be made for the algorithms.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2021-03-04 without embargo terms","The student, Bo Zheng, accepted the attached license on 2020-12-09 at 11:39.","The student, Bo Zheng, submitted this Thesis for approval on 2020-12-09 at 11:49.","This Thesis was approved for publication on 2020-12-09 at 16:00.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16096 on 2021-03-04 at 15:36:20","Made available in DSpace on 2021-03-05T21:38:23Z (GMT). No. of bitstreams: 2 ZHENG-THESIS-2020.pdf: 4470918 bytes, checksum: 89e260c7ec70308a8dba10743588fa01 (MD5) LICENSE.txt: 4205 bytes, checksum: c309551c1d4a6311bbebbc5886681594 (MD5) Previous issue date: 2020-12-09"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Persuasiveness of text messages generated by machine learning language model"]}]}],"canonical_facts":{"dc:contributor":["Sundaram, Hari"],"dc:creator":["Zheng, Bo"],"dc:date":["2021-03-05T21:38:23Z","2020-12-09","2020-12"],"dc:description":["The objective of this study is to examine the effectiveness of our algorithm that applies a machine learning language model to convert the message to be memorable and persuasive. We designed an algorithm that takes an input sentence, and by changing the sentence to be more general in the syntax level, and more distinctive at the lexical level with the masked language model, we will convert the input sentence to be more memorable and more effective at persuading people to change their attitude. We came up with two versions of the algorithm that have a slight difference of focus on the attributes of the output sentences, and we designed an experiment in Mechanical Turk to compare these two versions of the algorithm. In this study, we first introduce an algorithm that is consisted mainly of two steps. First, the algorithm will convert an input text message to be more general at the level of sentence structure, then the algorithm will compose a sentence with more distinctive words. We created two versions of the algorithm that have their advantages: one version of the algorithm focus on replacing original words with distinctive synonymous, thus keeping the original meaning of the input sentence during the generation process; the other version focuses on replacing words with more distinctive vocabularies, not only restricted to synonyms, thus making the sentence with more variations for vocabularies and more memorable to readers. To compare these two versions of an algorithm for their effectiveness at converting a sentence to be more memorable and more persuasive, we experimented on Mechanical Turk. Our experiment results show that sentences with more general sentence structure and more distinctive words contribute to memorability and persuasiveness of sentences, but the results also suggest several improvements should be made for the algorithms.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2021-03-04 without embargo terms","The student, Bo Zheng, accepted the attached license on 2020-12-09 at 11:39.","The student, Bo Zheng, submitted this Thesis for approval on 2020-12-09 at 11:49.","This Thesis was approved for publication on 2020-12-09 at 16:00.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16096 on 2021-03-04 at 15:36:20","Made available in DSpace on 2021-03-05T21:38:23Z (GMT). No. of bitstreams: 2 ZHENG-THESIS-2020.pdf: 4470918 bytes, checksum: 89e260c7ec70308a8dba10743588fa01 (MD5) LICENSE.txt: 4205 bytes, checksum: c309551c1d4a6311bbebbc5886681594 (MD5) Previous issue date: 2020-12-09"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/109448"],"dc:language":["en"],"dc:rights":["Copyright 2020 Bo Zheng"],"dc:subject":["persuasive message generation","machine learning"],"dc:title":["Persuasiveness of text messages generated by machine learning language model"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:50Z"}