{"id":"https://openalex.org/W2250294038","doi":"https://doi.org/10.3115/v1/p14-1117","title":"Approximation Strategies for Multi-Structure Sentence Compression","display_name":"Approximation Strategies for Multi-Structure Sentence Compression","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2250294038","doi":"https://doi.org/10.3115/v1/p14-1117","mag":"2250294038"},"language":"en","primary_location":{"id":"doi:10.3115/v1/p14-1117","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/p14-1117","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3115/v1/p14-1117","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005163929","display_name":"Kapil Thadani","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kapil Thadani","raw_affiliation_strings":["Columbia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005163929"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":1.0339,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79100116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1241","last_page":"1251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","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/T10181","display_name":"Natural Language Processing Techniques","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/T10028","display_name":"Topic Modeling","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/T10215","display_name":"Semantic Web and Ontologies","score":0.9927999973297119,"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/computer-science","display_name":"Computer science","score":0.6057794690132141},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5854853987693787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5114187598228455},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.508698046207428},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.494021475315094},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4709024429321289},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4684942662715912},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4275391101837158},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4167400896549225},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4141068458557129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40250542759895325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38565143942832947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2857106924057007},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2674148976802826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6057794690132141},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5854853987693787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5114187598228455},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.508698046207428},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.494021475315094},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4709024429321289},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4684942662715912},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4275391101837158},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4167400896549225},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4141068458557129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40250542759895325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38565143942832947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2857106924057007},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2674148976802826},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3115/v1/p14-1117","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/p14-1117","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.639.434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.columbia.edu/~kapil/documents/acl14ddcomp.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3115/v1/p14-1117","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/p14-1117","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W155324349","https://openalex.org/W607342991","https://openalex.org/W1498416817","https://openalex.org/W1513168555","https://openalex.org/W1552023264","https://openalex.org/W1664028424","https://openalex.org/W1812474519","https://openalex.org/W1899684160","https://openalex.org/W1903393809","https://openalex.org/W1959120443","https://openalex.org/W1964326564","https://openalex.org/W1999447745","https://openalex.org/W2001122765","https://openalex.org/W2001135856","https://openalex.org/W2005603124","https://openalex.org/W2008652694","https://openalex.org/W2081388731","https://openalex.org/W2083451366","https://openalex.org/W2098919260","https://openalex.org/W2113107210","https://openalex.org/W2114741181","https://openalex.org/W2115322217","https://openalex.org/W2115937944","https://openalex.org/W2118119027","https://openalex.org/W2118681326","https://openalex.org/W2122311631","https://openalex.org/W2122922578","https://openalex.org/W2128774237","https://openalex.org/W2129227538","https://openalex.org/W2130571329","https://openalex.org/W2133182690","https://openalex.org/W2139761450","https://openalex.org/W2142603219","https://openalex.org/W2144637381","https://openalex.org/W2145110208","https://openalex.org/W2145882814","https://openalex.org/W2146968241","https://openalex.org/W2154862802","https://openalex.org/W2159992248","https://openalex.org/W2161227214","https://openalex.org/W2163117351","https://openalex.org/W2164618588","https://openalex.org/W2251303282","https://openalex.org/W2251384446","https://openalex.org/W2251425698","https://openalex.org/W2251656952","https://openalex.org/W2252239149","https://openalex.org/W3150541299"],"related_works":["https://openalex.org/W2002102264","https://openalex.org/W4237964977","https://openalex.org/W1996993548","https://openalex.org/W4285149922","https://openalex.org/W3032916910","https://openalex.org/W4312837919","https://openalex.org/W1510357621","https://openalex.org/W2981882443","https://openalex.org/W2899851694","https://openalex.org/W2111955424"],"abstract_inverted_index":{"Sentence":[0],"compression":[1],"has":[2],"been":[3],"shown":[4],"to":[5,31,61,96],"benefit":[6],"from":[7],"joint":[8,106],"inference":[9,82,107],"involving":[10],"both":[11],"n-gram":[12],"and":[13,36,67],"dependency-factored":[14],"objec-tives":[15],"but":[16],"this":[17,62],"typically":[18],"requires":[19],"expensive":[20],"integer":[21,99],"programming.":[22],"We":[23,57],"explore":[24],"instead":[25],"the":[26,33,79,104],"use":[27],"of":[28],"Lagrangian":[29],"relaxation":[30,66],"decou-ple":[32],"two":[34],"subproblems":[35],"solve":[37],"them":[38],"separately.":[39],"While":[40],"dynamic":[41],"programming":[42,101],"is":[43,55],"viable":[44],"for":[45,103],"bigram-based":[46,81],"sentence":[47],"com-pression,":[48],"finding":[49],"optimal":[50],"compressed":[51],"trees":[52],"within":[53],"graphs":[54],"NP-hard.":[56],"recover":[58],"ap-proximate":[59],"solutions":[60],"problem":[63],"us-ing":[64],"LP":[65],"maximum":[68],"spanning":[69],"tree":[70],"algorithms,":[71],"yielding":[72],"techniques":[73],"that":[74,89],"can":[75],"be":[76],"combined":[77],"with":[78,110],"efficient":[80],"approach":[83],"using":[84],"Lagrange":[85],"multipliers.":[86],"Experiments":[87],"show":[88],"these":[90],"approximation":[91],"strategies":[92],"produce":[93],"results":[94],"comparable":[95],"a":[97,111],"state-of-the-art":[98],"linear":[100],"formulation":[102],"same":[105],"task":[108],"along":[109],"sig-nificant":[112],"improvement":[113],"in":[114],"runtime.":[115],"1":[116]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}