{"id":"https://openalex.org/W2006191288","doi":"https://doi.org/10.1162/coli_a_00246","title":"Synchronous Context-Free Grammars and Optimal Parsing Strategies","display_name":"Synchronous Context-Free Grammars and Optimal Parsing Strategies","publication_year":2016,"publication_date":"2016-04-27","ids":{"openalex":"https://openalex.org/W2006191288","doi":"https://doi.org/10.1162/coli_a_00246","mag":"2006191288"},"language":"en","primary_location":{"id":"doi:10.1162/coli_a_00246","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00246","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/COLI_a_00246","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"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":null,"license_id":null,"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":"bronze","oa_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/COLI_a_00246","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":false,"raw_author_name":"Daniel Gildea","raw_affiliation_strings":["University of Rochester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rochester","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","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":false,"raw_author_name":"Giorgio Satta","raw_affiliation_strings":["Universit\u00e0 di Padova"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Padova","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8662,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82855132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"42","issue":"2","first_page":"207","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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.9980000257492065,"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/T12029","display_name":"DNA and Biological Computing","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7383506298065186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.733374297618866},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.6662209630012512},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.608161211013794},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.5814400315284729},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5628019571304321},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.530426025390625},{"id":"https://openalex.org/keywords/parser-combinator","display_name":"Parser combinator","score":0.49583134055137634},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.47556060552597046},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4246610701084137},{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.4138683080673218},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4066017270088196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3732186257839203},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.3655529022216797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.296468049287796}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7383506298065186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.733374297618866},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.6662209630012512},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.608161211013794},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.5814400315284729},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5628019571304321},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.530426025390625},{"id":"https://openalex.org/C118364021","wikidata":"https://www.wikidata.org/wiki/Q7139956","display_name":"Parser combinator","level":3,"score":0.49583134055137634},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.47556060552597046},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4246610701084137},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.4138683080673218},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4066017270088196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3732186257839203},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.3655529022216797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.296468049287796},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1162/coli_a_00246","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00246","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/COLI_a_00246","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7ae723a8816d487fbff65ac3c6e64dac","is_oa":false,"landing_page_url":"https://doaj.org/article/7ae723a8816d487fbff65ac3c6e64dac","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Linguistics, Vol 42, Iss 2 (2021)","raw_type":"article"},{"id":"pmh:oai:www.research.unipd.it:11577/3256340","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3256340","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:191912","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/191912","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_00246","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00246","pdf_url":"https://www.mitpressjournals.org/doi/pdf/10.1162/COLI_a_00246","source":{"id":"https://openalex.org/S155526855","display_name":"Computational Linguistics","issn_l":"0891-2017","issn":["0891-2017","1530-9312"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Linguistics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.49000000953674316}],"awards":[{"id":"https://openalex.org/G7276118644","display_name":null,"funder_award_id":"2010LYA9RH","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G8016008144","display_name":"EAGER: Collaborative Research: Scaling Up Discriminative Learning for Natural Language Understanding and Translation","funder_award_id":"1446996","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"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2006191288.pdf","grobid_xml":"https://content.openalex.org/works/W2006191288.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W65294924","https://openalex.org/W128510811","https://openalex.org/W1484794585","https://openalex.org/W1511588645","https://openalex.org/W1518606313","https://openalex.org/W1551202288","https://openalex.org/W1628915153","https://openalex.org/W1838434530","https://openalex.org/W1970961429","https://openalex.org/W2002089154","https://openalex.org/W2006969979","https://openalex.org/W2010025177","https://openalex.org/W2019137761","https://openalex.org/W2030371045","https://openalex.org/W2035796100","https://openalex.org/W2048808408","https://openalex.org/W2049609719","https://openalex.org/W2059372025","https://openalex.org/W2072495696","https://openalex.org/W2076749875","https://openalex.org/W2084187640","https://openalex.org/W2085550081","https://openalex.org/W2089385274","https://openalex.org/W2096894677","https://openalex.org/W2099851297","https://openalex.org/W2121924470","https://openalex.org/W2126641717","https://openalex.org/W2134495021","https://openalex.org/W2146834222","https://openalex.org/W2150093871","https://openalex.org/W2153653739","https://openalex.org/W2164783947","https://openalex.org/W2437005631","https://openalex.org/W2439662238","https://openalex.org/W2599142459","https://openalex.org/W2616709338"],"related_works":["https://openalex.org/W3143982968","https://openalex.org/W4320024782","https://openalex.org/W2090257971","https://openalex.org/W1560736395","https://openalex.org/W2108246103","https://openalex.org/W2077094028","https://openalex.org/W2175212756","https://openalex.org/W2943197582","https://openalex.org/W2624167784","https://openalex.org/W108108158"],"abstract_inverted_index":{"The":[0],"complexity":[1,108],"of":[2,21,35,52,62,73,118],"parsing":[3,45,66],"with":[4,89,104],"synchronous":[5],"context-free":[6],"grammars":[7],"is":[8,82],"polynomial":[9,23],"in":[10,71],"the":[11,19,22,26,29,33,37,41,44,50,60,64,86,90,102,105,116],"sentence":[12],"length":[13,34],"for":[14,68,100,114],"a":[15,53,69],"fixed":[16],"grammar,":[17],"but":[18],"degree":[20,30],"depends":[24,31],"on":[25,32],"grammar.":[27],"Specifically,":[28],"rules,":[36,42],"permutations":[38],"represented":[39],"by":[40],"and":[43,75],"strategy":[46,67,88,103],"adopted":[47],"to":[48,84],"decompose":[49],"recognition":[51],"rule":[54],"into":[55],"smaller":[56],"steps.":[57],"We":[58,78,94],"address":[59],"problem":[61],"finding":[63,101,115],"best":[65],"rule,":[70],"terms":[72],"space":[74,92],"time":[76,107],"complexity.":[77,93],"show":[79,96],"that":[80,97],"it":[81],"NP-hard":[83],"find":[85],"binary":[87],"lowest":[91,106],"also":[95],"any":[98],"algorithm":[99],"would":[109],"imply":[110],"improved":[111],"approximation":[112],"algorithms":[113],"treewidth":[117],"general":[119],"graphs.":[120]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}