{"id":"https://openalex.org/W2165552617","doi":"https://doi.org/10.1162/0891201054223968","title":"Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes","display_name":"Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2165552617","doi":"https://doi.org/10.1162/0891201054223968","mag":"2165552617"},"language":"en","primary_location":{"id":"doi:10.1162/0891201054223968","is_oa":true,"landing_page_url":"https://doi.org/10.1162/0891201054223968","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/0891201054223968","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/0891201054223968","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004268590","display_name":"Laura Kallmeyer","orcid":"https://orcid.org/0000-0001-9691-5990"},"institutions":[{"id":"https://openalex.org/I4210134114","display_name":"Langues, Textes, Traitements Informatiques, Cognition","ror":"https://ror.org/03ms1y683","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I182627622","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210134114","https://openalex.org/I4210150854"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Laura Kallmeyer","raw_affiliation_strings":["TALaNa/Lattice, Universit\u00e9 Paris7"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TALaNa/Lattice, Universit\u00e9 Paris7","institution_ids":["https://openalex.org/I4210134114"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004268590"],"corresponding_institution_ids":["https://openalex.org/I4210134114"],"apc_list":null,"apc_paid":null,"fwci":3.6755,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.9342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"31","issue":"2","first_page":"187","last_page":"225"},"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/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9848999977111816,"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/scrambling","display_name":"Scrambling","score":0.9467846155166626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7954598665237427},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.7596651315689087},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6256431341171265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5516341328620911},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5270695090293884},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5168871879577637},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.5158714056015015},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5045555830001831},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5037493109703064},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46615681052207947},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4343511760234833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3915649950504303},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.3586100935935974},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30049294233322144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.191270112991333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15898752212524414},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1404430866241455}],"concepts":[{"id":"https://openalex.org/C182548165","wikidata":"https://www.wikidata.org/wiki/Q2261483","display_name":"Scrambling","level":2,"score":0.9467846155166626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7954598665237427},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7596651315689087},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6256431341171265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5516341328620911},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5270695090293884},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5168871879577637},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.5158714056015015},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5045555830001831},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5037493109703064},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46615681052207947},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4343511760234833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3915649950504303},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.3586100935935974},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30049294233322144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.191270112991333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15898752212524414},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1404430866241455},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/0891201054223968","is_oa":true,"landing_page_url":"https://doi.org/10.1162/0891201054223968","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/0891201054223968","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:CiteSeerX.psu:10.1.1.107.1911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.1911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aclweb.org/anthology-new/J/J05/J05-2003.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.9074","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.9074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://talana.linguist.jussieu.fr/~lkallmey/papers/snmctag.ps.gz","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:bd61c5de771841a297844774a84696d9","is_oa":false,"landing_page_url":"https://doaj.org/article/bd61c5de771841a297844774a84696d9","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 31, Iss 2 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1162/0891201054223968","is_oa":true,"landing_page_url":"https://doi.org/10.1162/0891201054223968","pdf_url":"http://www.mitpressjournals.org/doi/pdf/10.1162/0891201054223968","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2165552617.pdf","grobid_xml":"https://content.openalex.org/works/W2165552617.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W21072717","https://openalex.org/W40146586","https://openalex.org/W92394816","https://openalex.org/W93361745","https://openalex.org/W108521070","https://openalex.org/W125699335","https://openalex.org/W862504636","https://openalex.org/W1479758177","https://openalex.org/W1489734685","https://openalex.org/W1497441877","https://openalex.org/W1507910031","https://openalex.org/W1508382620","https://openalex.org/W1519201847","https://openalex.org/W1526927911","https://openalex.org/W1540645127","https://openalex.org/W1587360613","https://openalex.org/W1985914024","https://openalex.org/W2001057949","https://openalex.org/W2007260766","https://openalex.org/W2020552488","https://openalex.org/W2045474929","https://openalex.org/W2082514075","https://openalex.org/W2085153732","https://openalex.org/W2085603207","https://openalex.org/W2106819855","https://openalex.org/W2114056815","https://openalex.org/W2125167152","https://openalex.org/W2130035786","https://openalex.org/W2130630493","https://openalex.org/W2153198088","https://openalex.org/W2155074016","https://openalex.org/W2155149900","https://openalex.org/W2616709338","https://openalex.org/W2735538735","https://openalex.org/W3037996278","https://openalex.org/W4231741839","https://openalex.org/W4241850027","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2153803459","https://openalex.org/W2136486688","https://openalex.org/W1608157979","https://openalex.org/W4285260839","https://openalex.org/W2019001464","https://openalex.org/W1980918784","https://openalex.org/W2012632856","https://openalex.org/W2918124307","https://openalex.org/W1557335907","https://openalex.org/W2054207931"],"abstract_inverted_index":{"This":[0],"article":[1,47],"addresses":[2],"the":[3,6,46,58],"problem":[4],"that":[5,54,85,97],"expressive":[7],"power":[8],"of":[9,52,60,74,100],"tree-adjoining":[10],"grammars":[11,108],"(TAGs)":[12],"is":[13,55,79,95],"too":[14],"limited":[15],"to":[16,37,83],"deal":[17,90,130],"with":[18,24,68,91,132,137],"certain":[19],"syntactic":[20],"phenomena,":[21,135],"in":[22,26,35,81,121],"particular,":[23],"scrambling":[25,40,77,134],"free-word-order":[27],"languages.":[28],"The":[29,72],"TAG":[30,53,67,87],"variants":[31],"proposed":[32],"so":[33],"far":[34],"order":[36,82],"account":[38],"for":[39,98],"are":[41,117],"not":[42,131],"entirely":[43],"satisfying.":[44],"Therefore,":[45],"introduces":[48],"an":[49,138],"alternative":[50],"extension":[51,88],"based":[56],"on":[57],"notion":[59],"node":[61],"sharing,":[62],"so-called":[63],"(restricted)":[64],"tree-local":[65],"multicomponent":[66],"shared":[69],"nodes":[70],"(RSN-MCTAG).":[71],"analysis":[73],"some":[75],"German":[76],"data":[78],"sketched":[80],"show":[84],"this":[86],"can":[89,109,129],"scrambling.":[92],"Then":[93],"it":[94],"shown":[96],"RSN-MCTAGs":[99,116,127],"a":[101,113],"specific":[102,126],"type,":[103],"equivalent":[104],"simple":[105],"range":[106],"concatenation":[107],"be":[110],"constructed.":[111],"As":[112],"consequence,":[114],"these":[115],"mildly":[118],"context-sensitive":[119],"and":[120],"particular":[122],"polynomially":[123],"parsable.":[124],"These":[125],"probably":[128],"all":[133],"but":[136],"arbitrarily":[139],"large":[140],"subset.":[141]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}