{"id":"https://openalex.org/W2944833000","doi":"https://doi.org/10.18653/v1/n19-1173","title":"Single Document Summarization as Tree Induction","display_name":"Single Document Summarization as Tree Induction","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2944833000","doi":"https://doi.org/10.18653/v1/n19-1173","mag":"2944833000"},"language":"en","primary_location":{"id":"doi:10.18653/v1/n19-1173","is_oa":false,"landing_page_url":"https://doi.org/10.18653/v1/n19-1173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 Conference of the North","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.uva.nl/ws/files/49722503/N19_1173.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100355692","display_name":"Yang Liu","orcid":"https://orcid.org/0000-0001-7300-9215"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Yang Liu","raw_affiliation_strings":["Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB"],"affiliations":[{"raw_affiliation_string":"Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086717154","display_name":"Ivan Titov","orcid":"https://orcid.org/0000-0002-2583-1893"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ivan Titov","raw_affiliation_strings":["Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB"],"affiliations":[{"raw_affiliation_string":"Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041024491","display_name":"Mirella Lapata","orcid":"https://orcid.org/0000-0002-2107-1516"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mirella Lapata","raw_affiliation_strings":["Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB"],"affiliations":[{"raw_affiliation_string":"Institute for Language, Cognition and Computation School of Informatics, University of Edinburgh 10 Crichton Street, Edinburgh EH8 9AB","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100355692"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":10.8386,"has_fulltext":true,"cited_by_count":100,"citation_normalized_percentile":{"value":0.98593157,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13083","display_name":"Advanced Text Analysis Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.8975945115089417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7502261996269226},{"id":"https://openalex.org/keywords/multi-document-summarization","display_name":"Multi-document summarization","score":0.5516228079795837},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5070524215698242},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.5030612349510193},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.33274349570274353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07914167642593384}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.8975945115089417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7502261996269226},{"id":"https://openalex.org/C134714966","wikidata":"https://www.wikidata.org/wiki/Q6934448","display_name":"Multi-document summarization","level":3,"score":0.5516228079795837},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5070524215698242},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.5030612349510193},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.33274349570274353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07914167642593384},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.18653/v1/n19-1173","is_oa":false,"landing_page_url":"https://doi.org/10.18653/v1/n19-1173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 Conference of the North","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/single-document-summarization-as-tree-induction(9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2).html","pdf_url":"https://pure.uva.nl/ws/files/49722503/N19_1173.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, Y, Titov, I & Lapata, M 2019, Single Document Summarization as Tree Induction. in J Burstein, C Doran & T Solorio (eds), The 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies : NAACL HLT 2019 : proceedings of the conference : June 2-June 7, 2019. vol. 1, Stroudsburg, PA, pp. 1745-1755, 2019 Conference of the North American Chapter of the Association for Computational Linguistics, Minneapolis, Minnesota, United States, 2/06/19. https://doi.org/10.18653/v1/N19-1173","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/3d1e85d7-0ae1-481d-b516-e9c219c43f01","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/3d1e85d7-0ae1-481d-b516-e9c219c43f01","pdf_url":"https://www.pure.ed.ac.uk/ws/files/84916217/Single_Document_Summarization_LIU_DoA220219_AFV.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/single-document-summarization-as-tree-induction(9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2).html","pdf_url":"https://dare.uva.nl/personal/pure/en/publications/single-document-summarization-as-tree-induction(9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2).html","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies: NAACL HLT 2019 : proceedings of the conference : June 2-June 7, 2019, 1, 1745 - 1755","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:dare.uva.nl:publications/9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2","is_oa":false,"landing_page_url":"https://github.com/nlpyang/SUMO","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:openaire/3d1e85d7-0ae1-481d-b516-e9c219c43f01","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3d1e85d7-0ae1-481d-b516-e9c219c43f01","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, Y, Titov, I & Lapata, M 2019, Single Document Summarization as Tree Induction. in J Burstein, C Doran & T Solorio (eds), Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics. vol. 1, Minneapolis, Minnesota, pp. 1745\u20131755, 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Minneapolis, Minnesota, United States, 2/06/19. https://doi.org/10.18653/v1/n19-1173","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/single-document-summarization-as-tree-induction(9cbc9bc7-f54d-49a9-b2ee-6ce568580cc2).html","pdf_url":"https://pure.uva.nl/ws/files/49722503/N19_1173.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Liu, Y, Titov, I & Lapata, M 2019, Single Document Summarization as Tree Induction. in J Burstein, C Doran & T Solorio (eds), The 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies : NAACL HLT 2019 : proceedings of the conference : June 2-June 7, 2019. vol. 1, Stroudsburg, PA, pp. 1745-1755, 2019 Conference of the North American Chapter of the Association for Computational Linguistics, Minneapolis, Minnesota, United States, 2/06/19. https://doi.org/10.18653/v1/N19-1173","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2944833000.pdf","grobid_xml":"https://content.openalex.org/works/W2944833000.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W47641349","https://openalex.org/W1497300277","https://openalex.org/W1544827683","https://openalex.org/W1574662932","https://openalex.org/W1632114991","https://openalex.org/W2026191715","https://openalex.org/W2044599851","https://openalex.org/W2045738181","https://openalex.org/W2064675550","https://openalex.org/W2133564696","https://openalex.org/W2148404145","https://openalex.org/W2154652894","https://openalex.org/W2157331557","https://openalex.org/W2166957049","https://openalex.org/W2251454145","https://openalex.org/W2251803607","https://openalex.org/W2252267789","https://openalex.org/W2270627573","https://openalex.org/W2293771131","https://openalex.org/W2307381258","https://openalex.org/W2574535369","https://openalex.org/W2600702321","https://openalex.org/W2606974598","https://openalex.org/W2626454479","https://openalex.org/W2791751435","https://openalex.org/W2798858969","https://openalex.org/W2883510303","https://openalex.org/W2888556271","https://openalex.org/W2890419630","https://openalex.org/W2890627034","https://openalex.org/W2949615363","https://openalex.org/W2949847915","https://openalex.org/W2952138241","https://openalex.org/W2962783338","https://openalex.org/W2962972512","https://openalex.org/W2963047186","https://openalex.org/W2963125472","https://openalex.org/W2963355447","https://openalex.org/W2963385935","https://openalex.org/W2963403868","https://openalex.org/W2963434219","https://openalex.org/W2963451457","https://openalex.org/W2963655973","https://openalex.org/W2963899396","https://openalex.org/W2964015378","https://openalex.org/W2964076774","https://openalex.org/W2964308564","https://openalex.org/W3151369355","https://openalex.org/W3158986179","https://openalex.org/W4250641076","https://openalex.org/W4293865263","https://openalex.org/W4295253143","https://openalex.org/W4323347028","https://openalex.org/W4385245566","https://openalex.org/W4394666973"],"related_works":["https://openalex.org/W2104677027","https://openalex.org/W3164984162","https://openalex.org/W2902627734","https://openalex.org/W2112885393","https://openalex.org/W1990695371","https://openalex.org/W2173208124","https://openalex.org/W2099859325","https://openalex.org/W2065541085","https://openalex.org/W2568827738","https://openalex.org/W2365100044"],"abstract_inverted_index":{"In":[0,13],"this":[1],"paper,":[2],"we":[3],"conceptualize":[4],"single-document":[5],"extractive":[6],"summarization":[7],"as":[8],"a":[9,32,48,70],"tree":[10,35,46],"induction":[11],"problem.":[12],"contrast":[14],"to":[15,26,55,62],"previous":[16,86],"approaches":[17],"which":[18],"have":[19],"relied":[20],"on":[21,91],"linguistically":[22],"motivated":[23],"document":[24],"representations":[25],"generate":[27],"summaries,":[28],"our":[29,96],"model":[30],"induces":[31,76],"multi-root":[33],"dependency":[34],"while":[36],"predicting":[37],"the":[38,45,52,65,77,82],"output":[39],"summary.":[40],"Each":[41],"root":[42],"node":[43],"in":[44],"is":[47],"summary":[49,66],"sentence,":[50],"and":[51],"subtrees":[53],"attached":[54],"it":[56,75],"are":[57],"sentences":[58],"whose":[59],"content":[60],"relates":[61],"or":[63],"explains":[64],"sentence.":[67],"We":[68,88],"design":[69],"new":[71],"iterative":[72],"refinement":[73],"algorithm:":[74],"trees":[78],"through":[79],"repeatedly":[80],"refining":[81],"structures":[83],"predicted":[84],"by":[85],"iterations.":[87],"demonstrate":[89],"experimentally":[90],"two":[92],"benchmark":[93],"datasets":[94],"that":[95],"summarizer":[97],"performs":[98],"competitively":[99],"against":[100],"state-of-the-art":[101],"methods.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":26},{"year":2020,"cited_by_count":25},{"year":2019,"cited_by_count":6}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}
