{"id":"https://openalex.org/W2923435069","doi":"https://doi.org/10.1162/coli_a_00350","title":"Ordered Tree Decomposition for HRG Rule Extraction","display_name":"Ordered Tree Decomposition for HRG Rule Extraction","publication_year":2019,"publication_date":"2019-03-20","ids":{"openalex":"https://openalex.org/W2923435069","doi":"https://doi.org/10.1162/coli_a_00350","mag":"2923435069"},"language":"en","primary_location":{"id":"doi:10.1162/coli_a_00350","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00350","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00350","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00350","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020945377","display_name":"Daniel Gildea","orcid":"https://orcid.org/0000-0002-7858-2624"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel Gildea","raw_affiliation_strings":["University of Rochester, Computer Science Department"],"affiliations":[{"raw_affiliation_string":"University of Rochester, Computer Science Department","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068504877","display_name":"Giorgio Satta","orcid":"https://orcid.org/0000-0001-7742-6438"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giorgio Satta","raw_affiliation_strings":["Universit\u00e0 di Padova, Dipartimento di Ingegneria dell\u2019Informazione"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova, Dipartimento di Ingegneria dell\u2019Informazione","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100908682","display_name":"Xiaochang Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiaochang Peng","raw_affiliation_strings":["University of Rochester, Computer Science Department"],"affiliations":[{"raw_affiliation_string":"University of Rochester, Computer Science Department","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020945377","https://openalex.org/A5068504877","https://openalex.org/A5100908682"],"corresponding_institution_ids":["https://openalex.org/I138689650","https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":0.1445,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55498678,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"45","issue":"2","first_page":"339","last_page":"379"},"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.9973000288009644,"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.9830999970436096,"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.7126610279083252},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6009618043899536},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.526267409324646},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46502208709716797},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46478936076164246},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.44309863448143005},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.43696504831314087},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4151308536529541},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.41285932064056396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3711065948009491},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35364726185798645},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3336840569972992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33062273263931274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27976739406585693},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2702610492706299},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18265944719314575},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.138790100812912},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1251356303691864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7126610279083252},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6009618043899536},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.526267409324646},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46502208709716797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46478936076164246},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44309863448143005},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.43696504831314087},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4151308536529541},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.41285932064056396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3711065948009491},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35364726185798645},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3336840569972992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33062273263931274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27976739406585693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2702610492706299},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18265944719314575},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.138790100812912},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1251356303691864}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1162/coli_a_00350","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00350","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00350","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:bfb0194d49b641a883676ddf0a882cec","is_oa":true,"landing_page_url":"https://doaj.org/article/bfb0194d49b641a883676ddf0a882cec","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Linguistics, Vol 45, Iss 2, Pp 339-379 (2019)","raw_type":"article"},{"id":"pmh:oai:www.research.unipd.it:11577/3330877","is_oa":true,"landing_page_url":"http://hdl.handle.net/11577/3330877","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:72650","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/72650","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1162/coli_a_00350","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00350","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00350","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320244","host_organization_name":"Association for Computational Linguistics","host_organization_lineage":["https://openalex.org/P4310320244"],"host_organization_lineage_names":["Association for Computational Linguistics"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G2353721992","display_name":"RI: Small: Cache transition systems for sentence understanding and generation","funder_award_id":"1813823","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6016239102","display_name":null,"funder_award_id":"1449828","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2923435069.pdf","grobid_xml":"https://content.openalex.org/works/W2923435069.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W127565347","https://openalex.org/W642719942","https://openalex.org/W655477013","https://openalex.org/W1517853909","https://openalex.org/W1524358346","https://openalex.org/W1607035479","https://openalex.org/W1768003599","https://openalex.org/W1802169671","https://openalex.org/W1829822087","https://openalex.org/W2029471547","https://openalex.org/W2041437718","https://openalex.org/W2052449326","https://openalex.org/W2088602194","https://openalex.org/W2108747161","https://openalex.org/W2110882317","https://openalex.org/W2124861326","https://openalex.org/W2133956246","https://openalex.org/W2134612861","https://openalex.org/W2149837184","https://openalex.org/W2153568660","https://openalex.org/W2155874201","https://openalex.org/W2158798160","https://openalex.org/W2250808720","https://openalex.org/W2251071803","https://openalex.org/W2252123671","https://openalex.org/W2294293728","https://openalex.org/W2407660615","https://openalex.org/W2475275044","https://openalex.org/W2514651853","https://openalex.org/W2523789507","https://openalex.org/W2561360547","https://openalex.org/W2610593052","https://openalex.org/W2621537751","https://openalex.org/W2738658885","https://openalex.org/W2739952768","https://openalex.org/W2746547352","https://openalex.org/W2759083144","https://openalex.org/W2772851365","https://openalex.org/W2788705621","https://openalex.org/W2798347870","https://openalex.org/W2914096745","https://openalex.org/W2964164798","https://openalex.org/W3037763987","https://openalex.org/W4210956481","https://openalex.org/W4238987926","https://openalex.org/W4241738801","https://openalex.org/W4256364531"],"related_works":["https://openalex.org/W2995115154","https://openalex.org/W4287991942","https://openalex.org/W2061048290","https://openalex.org/W2611872667","https://openalex.org/W1559350420","https://openalex.org/W2126464568","https://openalex.org/W1540916342","https://openalex.org/W2964888466","https://openalex.org/W2920579836","https://openalex.org/W2018192336"],"abstract_inverted_index":{"We":[0,87,129],"present":[1,89],"algorithms":[2,19,91,117,132],"for":[3,40,52,82,92,123],"extracting":[4,37],"Hyperedge":[5],"Replacement":[6],"Grammar":[7],"(HRG)":[8],"rules":[9],"from":[10],"a":[11,15,24,49,83,102,109],"graph":[12,58,84,110],"along":[13],"with":[14,136],"vertex":[16,33,103],"order.":[17],"Our":[18],"are":[20],"based":[21,94],"on":[22,95,142],"finding":[23,78],"tree":[25,80],"decomposition":[26],"of":[27,48,55,77,115,126,145],"smallest":[28],"width,":[29],"relative":[30],"to":[31,62,71,133],"the":[32,53,56,64,72,75,99,106,143,146],"order,":[34],"and":[35,105,121,140],"then":[36],"one":[38],"rule":[39],"each":[41],"node":[42],"in":[43,66,69],"this":[44],"structure.":[45,111],"The":[46,112],"assumption":[47],"fixed":[50],"order":[51],"vertices":[54],"input":[57,100],"makes":[59],"it":[60],"possible":[61],"solve":[63],"problem":[65,76],"polynomial":[67],"time,":[68],"contrast":[70],"fact":[73],"that":[74],"optimal":[79],"decompositions":[81],"is":[85,101,108,118],"NP-hard.":[86],"also":[88],"polynomial-time":[90],"parsing":[93,122],"our":[96,116,131],"HRGs,":[97],"where":[98],"sequence":[104],"output":[107],"intended":[113],"application":[114],"grammar":[119],"extraction":[120],"semantic":[124],"representation":[125],"natural":[127],"language.":[128],"apply":[130],"data":[134],"annotated":[135],"Abstract":[137],"Meaning":[138],"Representations":[139],"report":[141],"characteristics":[144],"resulting":[147],"grammars.":[148]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}