{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/4841"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/4841","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Toward abstractive multi-document summarization using submodular function-based framework, sentence compression and merging","abstract":"Automatic multi-document summarization is a process of generating a summary that contains the most important information from multiple documents. In this thesis, we design an automatic multi-document summarization system using different abstraction-based methods and submodularity. Our proposed model considers summarization as a budgeted submodular function maximization problem. The model integrates three important measures of a summary - namely importance, coverage, and non-redundancy, and we design a submodular function for each of them. In addition, we integrate sentence compression and sentence merging. When evaluated on the DUC 2004 data set, our generic summarizer has outperformed the state-of-the-art summarization systems in terms of ROUGE-1 recall and f1-measure. For query-focused summarization, we used the DUC 2007 data set where our system achieves statistically similar results to several well-established methods in terms of the ROUGE-2 measure.","abstract_html":"Automatic multi-document summarization is a process of generating a summary that contains the most important information from multiple documents. In this thesis, we design an automatic multi-document summarization system using different abstraction-based methods and submodularity. Our proposed model considers summarization as a budgeted submodular function maximization problem. The model integrates three important measures of a summary - namely importance, coverage, and non-redundancy, and we design a submodular function for each of them. In addition, we integrate sentence compression and sentence merging. When evaluated on the DUC 2004 data set, our generic summarizer has outperformed the state-of-the-art summarization systems in terms of ROUGE-1 recall and f1-measure. For query-focused summarization, we used the DUC 2007 data set where our system achieves statistically similar results to several well-established methods in terms of the ROUGE-2 measure.","abstract_has_math":false,"creators":["Tanvee, Moin Mahmud","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Chali, Yllias"],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-19T05:21:24Z","subjects":["automatic text summarization","abstraction-based","submodular function","generic-focused summarization","query-focused summarization","greedy algorithm","Natural language processing (Computer science) -- Research","Querying (Computer science)","Database searching","Parsing (Computer grammar)","Information retrieval","Question-answering systems -- Research","Computer science -- Mathematics"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/4841","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/4841","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F4841","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Chali, Yllias"]},{"key":"dc:creator","label":"Author","values":["Tanvee, Moin Mahmud","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-05-03T19:08:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-05-03T19:08:40Z"]},{"key":"dc:date.issued","label":"Date","values":["2016"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["automatic text summarization","abstraction-based","submodular function","generic-focused summarization","query-focused summarization","greedy algorithm","Natural language processing (Computer science) -- Research","Querying (Computer science)","Database searching","Parsing (Computer grammar)","Information retrieval","Question-answering systems -- Research","Computer science -- Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights.proquest","label":"Dc Rights Proquest","values":["No"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/4841"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Automatic multi-document summarization is a process of generating a summary that contains the most important information from multiple documents. In this thesis, we design an automatic multi-document summarization system using different abstraction-based methods and submodularity. Our proposed model considers summarization as a budgeted submodular function maximization problem. The model integrates three important measures of a summary - namely importance, coverage, and non-redundancy, and we design a submodular function for each of them. In addition, we integrate sentence compression and sentence merging. When evaluated on the DUC 2004 data set, our generic summarizer has outperformed the state-of-the-art summarization systems in terms of ROUGE-1 recall and f1-measure. For query-focused summarization, we used the DUC 2007 data set where our system achieves statistically similar results to several well-established methods in terms of the ROUGE-2 measure."]},{"key":"dc:embargo.terms","label":"Dc Embargo Terms","values":["No"]},{"key":"dc:title","label":"Title","values":["Toward abstractive multi-document summarization using submodular function-based framework, sentence compression and merging"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Chali, Yllias"],"dc:creator":["Tanvee, Moin Mahmud","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2017-05-03T19:08:40Z"],"dc:date.available":["2017-05-03T19:08:40Z"],"dc:date.issued":["2016"],"dc:description.abstract":["Automatic multi-document summarization is a process of generating a summary that contains the most important information from multiple documents. In this thesis, we design an automatic multi-document summarization system using different abstraction-based methods and submodularity. Our proposed model considers summarization as a budgeted submodular function maximization problem. The model integrates three important measures of a summary - namely importance, coverage, and non-redundancy, and we design a submodular function for each of them. In addition, we integrate sentence compression and sentence merging. When evaluated on the DUC 2004 data set, our generic summarizer has outperformed the state-of-the-art summarization systems in terms of ROUGE-1 recall and f1-measure. For query-focused summarization, we used the DUC 2007 data set where our system achieves statistically similar results to several well-established methods in terms of the ROUGE-2 measure."],"dc:embargo.terms":["No"],"dc:identifier.uri":["https://hdl.handle.net/10133/4841"],"dc:language.iso":["en_US"],"dc:publisher":["Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:rights.proquest":["No"],"dc:subject":["automatic text summarization","abstraction-based","submodular function","generic-focused summarization","query-focused summarization","greedy algorithm","Natural language processing (Computer science) -- Research","Querying (Computer science)","Database searching","Parsing (Computer grammar)","Information retrieval","Question-answering systems -- Research","Computer science -- Mathematics"],"dc:title":["Toward abstractive multi-document summarization using submodular function-based framework, sentence compression and merging"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-19T05:21:24Z"}