{"id":"https://openalex.org/W2128505798","doi":"https://doi.org/10.1162/coli_a_00005","title":"Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar","display_name":"Complexity, Parsing, and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar","publication_year":2010,"publication_date":"2010-07-27","ids":{"openalex":"https://openalex.org/W2128505798","doi":"https://doi.org/10.1162/coli_a_00005","mag":"2128505798"},"language":"en","primary_location":{"id":"doi:10.1162/coli_a_00005","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00005","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00005","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":"http://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00005","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039632994","display_name":"Rebecca Nesson","orcid":null},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rebecca Nesson","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University","institution_ids":["https://openalex.org/I136199984"]}]},{"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":false,"raw_author_name":"Giorgio Satta","raw_affiliation_strings":["Department of Information Engineering University of Padua","Department of Information Engineering University of Padua#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering University of Padua","institution_ids":[]},{"raw_affiliation_string":"Department of Information Engineering University of Padua#TAB#","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053102850","display_name":"Stuart M. Shieber","orcid":"https://orcid.org/0000-0002-7733-8195"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stuart M. Shieber","raw_affiliation_strings":["School of Engineering and Applied Sciences Harvard University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences Harvard University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.14597548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"36","issue":"3","first_page":"443","last_page":"480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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/T11567","display_name":"semigroups and automata theory","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8215819597244263},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.7412407398223877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6119095683097839},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5857670307159424},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5329870581626892},{"id":"https://openalex.org/keywords/generalized-phrase-structure-grammar","display_name":"Generalized phrase structure grammar","score":0.5290840268135071},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.44508737325668335},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.4295772910118103},{"id":"https://openalex.org/keywords/emergent-grammar","display_name":"Emergent grammar","score":0.3693588376045227},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3392540514469147},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.24240082502365112},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.18618953227996826},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.13257023692131042},{"id":"https://openalex.org/keywords/relational-grammar","display_name":"Relational grammar","score":0.11551886796951294}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8215819597244263},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.7412407398223877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6119095683097839},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5857670307159424},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5329870581626892},{"id":"https://openalex.org/C191563868","wikidata":"https://www.wikidata.org/wiki/Q1427416","display_name":"Generalized phrase structure grammar","level":5,"score":0.5290840268135071},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.44508737325668335},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.4295772910118103},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.3693588376045227},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3392540514469147},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.24240082502365112},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.18618953227996826},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.13257023692131042},{"id":"https://openalex.org/C61577278","wikidata":"https://www.wikidata.org/wiki/Q11655557","display_name":"Relational grammar","level":4,"score":0.11551886796951294},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1162/coli_a_00005","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00005","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00005","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:www.research.unipd.it:11577/2428158","is_oa":true,"landing_page_url":"http://hdl.handle.net/11577/2428158","pdf_url":"http://www.mitpressjournals.org/doi/abs/10.1162/coli_a_00005","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":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:dash.harvard.edu:1/4731603","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:4731603","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"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":"Journal Article"},{"id":"pmh:oai:doaj.org/article:5dc2ad2854f84dd7b1738e4ac49a152f","is_oa":false,"landing_page_url":"https://doaj.org/article/5dc2ad2854f84dd7b1738e4ac49a152f","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 36, Iss 3 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1162/coli_a_00005","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00005","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/coli_a_00005","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.75}],"awards":[{"id":"https://openalex.org/G161907744","display_name":"Synchronous Grammars and the Syntax-Semantics Interface","funder_award_id":"0827979","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/W2128505798.pdf","grobid_xml":"https://content.openalex.org/works/W2128505798.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W265673664","https://openalex.org/W1479758177","https://openalex.org/W1498505829","https://openalex.org/W1540645127","https://openalex.org/W1564942370","https://openalex.org/W1575161691","https://openalex.org/W1583096824","https://openalex.org/W1970961429","https://openalex.org/W1981743645","https://openalex.org/W2003979824","https://openalex.org/W2011039300","https://openalex.org/W2047092246","https://openalex.org/W2069820269","https://openalex.org/W2074204229","https://openalex.org/W2084187640","https://openalex.org/W2089385274","https://openalex.org/W2095988850","https://openalex.org/W2101793943","https://openalex.org/W2106819855","https://openalex.org/W2108636832","https://openalex.org/W2125786800","https://openalex.org/W2130035786","https://openalex.org/W2130630493","https://openalex.org/W2134495021","https://openalex.org/W2152096446","https://openalex.org/W2152907450","https://openalex.org/W2153198088","https://openalex.org/W2156430494","https://openalex.org/W2165552617","https://openalex.org/W2166713720","https://openalex.org/W2279170554","https://openalex.org/W2610522837","https://openalex.org/W2616709338","https://openalex.org/W2752885492","https://openalex.org/W3111705864","https://openalex.org/W3145128584","https://openalex.org/W4231741839","https://openalex.org/W4285719527","https://openalex.org/W4381925011"],"related_works":["https://openalex.org/W4244615522","https://openalex.org/W1972256049","https://openalex.org/W2338828339","https://openalex.org/W2166677757","https://openalex.org/W2141288413","https://openalex.org/W2049995120","https://openalex.org/W3123688778","https://openalex.org/W1634973882","https://openalex.org/W2033808215","https://openalex.org/W1994456160"],"abstract_inverted_index":{"Tree-Local":[0],"Multi-Component":[1],"Tree-Adjoining":[2],"Grammar":[3],"(TL-MCTAG)":[4],"is":[5,140],"an":[6,223],"appealing":[7],"formalism":[8,57],"for":[9,58,227],"natural":[10],"language":[11,89],"representation":[12],"because":[13],"it":[14,65,132],"arguably":[15],"allows":[16,32,64],"the":[17,20,55,69,73,79,82,91,136,152,173,177,199,210,215,239,242],"encapsulation":[18],"of":[19,23,34,86,93,138,151,154,163,172,176,214,241],"appropriate":[21],"domain":[22],"locality":[24],"within":[25],"its":[26,62,117],"elementary":[27],"structures.":[28],"Its":[29,97],"multicomponent":[30],"structure":[31,75],"modeling":[33],"lexical":[35],"items":[36],"that":[37,158,184,196],"may":[38,107],"ultimately":[39],"have":[40,108],"elements":[41],"far":[42],"apart":[43],"in":[44,127,170,205],"a":[45,59,87,114,148,193,229,233],"sentence,":[46],"such":[47],"as":[48,54],"quantifiers":[49],"and":[50,72,84,203,212],"wh-words.":[51],"When":[52],"used":[53],"base":[56],"synchronous":[60],"grammar,":[61],"flexibility":[63],"to":[66,77,124,129,167,231],"express":[67],"both":[68,209],"close":[70],"relationships":[71],"divergent":[74],"necessary":[76],"capture":[78],"links":[80],"between":[81],"syntax":[83,92],"semantics":[85],"single":[88],"or":[90],"two":[94],"different":[95],"languages.":[96],"limited":[98],"expressivity":[99,128],"provides":[100],"constraints":[101],"on":[102,113,198],"movement":[103],"and,":[104],"we":[105,180,191,221],"posit,":[106],"generated":[109],"additional":[110],"popularity":[111],"based":[112],"misconception":[115],"about":[116],"parsing":[118,194,201],"complexity.":[119],"Although":[120],"TL-MCTAG":[121,139,155,164,236],"was":[122,133],"shown":[123],"be":[125],"equivalent":[126,235],"TAG":[130],"when":[131,208],"first":[134],"introduced,":[135],"complexity":[137],"still":[141],"not":[142],"well":[143],"understood.":[144],"This":[145],"article":[146],"offers":[147],"thorough":[149],"examination":[150],"problem":[153],"recognition,":[156],"showing":[157],"even":[159],"highly":[160],"restricted":[161],"forms":[162],"are":[165,218],"NP-complete":[166],"recognize.":[168],"However,":[169],"spite":[171],"provable":[174],"difficulty":[175],"recognition":[178],"problem,":[179],"offer":[181,222],"several":[182],"algorithms":[183],"can":[185],"substantially":[186],"improve":[187],"processing":[188],"efficiency.":[189],"First,":[190],"present":[192],"algorithm":[195,226],"improves":[197],"baseline":[200],"method":[202],"runs":[204],"polynomial":[206],"time":[207],"fan-out":[211],"rank":[213,240],"input":[216],"grammar":[217,230,237,243],"bounded.":[219],"Second,":[220],"optimal,":[224],"efficient":[225],"factorizing":[228],"produce":[232],"strongly":[234],"with":[238],"minimized.":[244]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2016-06-24T00:00:00"}