{"id":"https://openalex.org/W2155874201","doi":"https://doi.org/10.18653/v1/s15-1031","title":"The complexity of finding the maximum spanning DAG and other restrictions for DAG parsing of natural language","display_name":"The complexity of finding the maximum spanning DAG and other restrictions for DAG parsing of natural language","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2155874201","doi":"https://doi.org/10.18653/v1/s15-1031","mag":"2155874201"},"language":"en","primary_location":{"id":"doi:10.18653/v1/s15-1031","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/s15-1031","pdf_url":"https://www.aclweb.org/anthology/S15-1031.pdf","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 Fourth Joint Conference on Lexical and Computational Semantics","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.aclweb.org/anthology/S15-1031.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056555815","display_name":"Natalie Schluter","orcid":"https://orcid.org/0000-0001-8215-4801"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Natalie Schluter","raw_affiliation_strings":["Center for Language Technology University of Copenhagen Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"Center for Language Technology University of Copenhagen Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056555815"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":1.7258,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88457013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9993000030517578,"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":0.9993000030517578,"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.987500011920929,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9857000112533569,"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.7669365406036377},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7164129614830017},{"id":"https://openalex.org/keywords/dependency-grammar","display_name":"Dependency grammar","score":0.5574199557304382},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.49389225244522095},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.459194540977478},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4416429102420807},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4277445077896118},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.422643780708313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42144346237182617},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4200414717197418},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41648489236831665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22398865222930908}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7669365406036377},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7164129614830017},{"id":"https://openalex.org/C164883195","wikidata":"https://www.wikidata.org/wiki/Q674834","display_name":"Dependency grammar","level":3,"score":0.5574199557304382},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.49389225244522095},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.459194540977478},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4416429102420807},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4277445077896118},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.422643780708313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42144346237182617},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4200414717197418},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41648489236831665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22398865222930908}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18653/v1/s15-1031","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/s15-1031","pdf_url":"https://www.aclweb.org/anthology/S15-1031.pdf","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 Fourth Joint Conference on Lexical and Computational Semantics","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.18653/v1/s15-1031","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/s15-1031","pdf_url":"https://www.aclweb.org/anthology/S15-1031.pdf","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 Fourth Joint Conference on Lexical and Computational Semantics","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2155874201.pdf","grobid_xml":"https://content.openalex.org/works/W2155874201.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W47641349","https://openalex.org/W189633613","https://openalex.org/W194033037","https://openalex.org/W1492961084","https://openalex.org/W1502293651","https://openalex.org/W1517853909","https://openalex.org/W1560681568","https://openalex.org/W1969866811","https://openalex.org/W1970961429","https://openalex.org/W1986500605","https://openalex.org/W1988615825","https://openalex.org/W1990255213","https://openalex.org/W2011039300","https://openalex.org/W2052449326","https://openalex.org/W2070745908","https://openalex.org/W2103316066","https://openalex.org/W2103649698","https://openalex.org/W2122922578","https://openalex.org/W2125225769","https://openalex.org/W2125716863","https://openalex.org/W2131160549","https://openalex.org/W2142521780","https://openalex.org/W2152907450","https://openalex.org/W2170112109","https://openalex.org/W2401610261","https://openalex.org/W2798435870","https://openalex.org/W2894257070","https://openalex.org/W2950415592","https://openalex.org/W3149604617","https://openalex.org/W4241738801"],"related_works":["https://openalex.org/W2251084681","https://openalex.org/W287510790","https://openalex.org/W2098784136","https://openalex.org/W3117798239","https://openalex.org/W2968543375","https://openalex.org/W2571817549","https://openalex.org/W2179743027","https://openalex.org/W4285666902","https://openalex.org/W2994684392","https://openalex.org/W2103342147"],"abstract_inverted_index":{"Recently,":[0],"there":[1],"has":[2,58,107],"been":[3,60],"renewed":[4],"interest":[5],"in":[6,28,62,89],"semantic":[7,31],"dependency":[8,32],"parsing,":[9],"among":[10],"which":[11],"one":[12],"of":[13,24,40,55,103,120,124],"the":[14,25,50,56,63,86,90,94,101,105,121,131],"paradigms":[15],"focuses":[16],"on":[17,128,136],"parsing":[18,33],"directed":[19,43],"acyclic":[20],"graphs":[21],"(DAGs).":[22],"Consideration":[23],"decoding":[26],"problem":[27,57,78,106],"natural":[29],"language":[30],"as":[34],"finding":[35],"a":[36,41,108],"maximum":[37],"spanning":[38],"DAG":[39],"weighted":[42],"graph":[44,126],"carries":[45],"many":[46],"complexities.":[47],"In":[48],"particular,":[49],"computational":[51],"complexity":[52],"(and":[53],"approximability)":[54],"not":[59],"addressed":[61],"literature":[64],"to":[65,70],"date.":[66],"This":[67],"paper":[68],"helps":[69],"fill":[71],"this":[72,76],"gap,":[73],"showing":[74],"that":[75,99],"general":[77],"is":[79,82],"APX-hard,":[80],"and":[81],"NP-hard":[83],"even":[84],"under":[85,100],"planar":[87],"restriction,":[88],"graphtheoretic":[91],"sense.":[92],"On":[93],"other":[95],"hand,":[96],"we":[97],"show":[98],"restriction":[102],"projectivity,":[104],"straightforward":[109],"O(n":[110],"3":[111],")":[112],"algorithm.":[113],"We":[114],"also":[115],"give":[116],"some":[117],"empirical":[118],"evidence":[119],"algorithmic":[122],"importance":[123],"these":[125],"restrictions,":[127],"data":[129],"from":[130],"SemEval":[132],"2014":[133],"task":[134],"8":[135],"Broad":[137],"Coverage":[138],"Semantic":[139],"Dependency":[140],"Parsing.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}