{"id":"https://openalex.org/W2112756777","doi":"https://doi.org/10.1162/coli_a_00090","title":"Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization","display_name":"Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization","publication_year":2011,"publication_date":"2011-12-08","ids":{"openalex":"https://openalex.org/W2112756777","doi":"https://doi.org/10.1162/coli_a_00090","mag":"2112756777"},"language":"en","primary_location":{"id":"doi:10.1162/coli_a_00090","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00090","pdf_url":"https://direct.mit.edu/coli/article-pdf/38/3/617/1810779/coli_a_00090.pdf","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://direct.mit.edu/coli/article-pdf/38/3/617/1810779/coli_a_00090.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069485198","display_name":"Marco Kuhlmann","orcid":"https://orcid.org/0000-0002-2492-9872"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Marco Kuhlmann","raw_affiliation_strings":["Uppsala University","Uppsala University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Uppsala University","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Uppsala University ,","institution_ids":["https://openalex.org/I123387679"]}]},{"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":["University of Padua","University of Padua ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padua","institution_ids":["https://openalex.org/I138689650"]},{"raw_affiliation_string":"University of Padua ,","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.3191,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62251831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"3","first_page":"617","last_page":"629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9987999796867371,"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.9796000123023987,"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/lexicalization","display_name":"Lexicalization","score":0.8778347969055176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6772222518920898},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6394093632698059},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.619092583656311},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6181426644325256},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.6114069223403931},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.601035475730896},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.5050433278083801},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5004775524139404},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.4172079563140869},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27151137590408325},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.21671411395072937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16732442378997803},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.05646076798439026}],"concepts":[{"id":"https://openalex.org/C2777532361","wikidata":"https://www.wikidata.org/wiki/Q687185","display_name":"Lexicalization","level":2,"score":0.8778347969055176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6772222518920898},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6394093632698059},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.619092583656311},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6181426644325256},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.6114069223403931},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.601035475730896},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.5050433278083801},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5004775524139404},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.4172079563140869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27151137590408325},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.21671411395072937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16732442378997803},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.05646076798439026}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1162/coli_a_00090","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00090","pdf_url":"https://direct.mit.edu/coli/article-pdf/38/3/617/1810779/coli_a_00090.pdf","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.361.2490","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.2490","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/J12/J12-3006.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:fbdef961521e46e28c46b0e7352e2660","is_oa":false,"landing_page_url":"https://doaj.org/article/fbdef961521e46e28c46b0e7352e2660","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 38, Iss 3 (2021)","raw_type":"article"},{"id":"pmh:oai:www.research.unipd.it:11577/2572710","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2572710","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:106589","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/106589","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_00090","is_oa":true,"landing_page_url":"https://doi.org/10.1162/coli_a_00090","pdf_url":"https://direct.mit.edu/coli/article-pdf/38/3/617/1810779/coli_a_00090.pdf","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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2112756777.pdf","grobid_xml":"https://content.openalex.org/works/W2112756777.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1479758177","https://openalex.org/W1504046386","https://openalex.org/W1526927911","https://openalex.org/W1550164500","https://openalex.org/W1564942370","https://openalex.org/W1988078800","https://openalex.org/W2130630493","https://openalex.org/W4231741839"],"related_works":["https://openalex.org/W59084530","https://openalex.org/W2055334547","https://openalex.org/W1564771228","https://openalex.org/W152266133","https://openalex.org/W1557335907","https://openalex.org/W2141471933","https://openalex.org/W1975076722","https://openalex.org/W3009523905","https://openalex.org/W176030811","https://openalex.org/W3013359325"],"abstract_inverted_index":{"A":[0],"lexicalized":[1,66],"tree-adjoining":[2,6,58],"grammar":[3,7],"is":[4],"a":[5,63,72],"where":[8,29],"each":[9],"elementary":[10,31],"tree":[11,32],"contains":[12],"some":[13],"overt":[14],"lexical":[15,24,46],"item.":[16],"Such":[17],"grammars":[18,78],"are":[19,79],"being":[20],"used":[21],"to":[22],"give":[23],"accounts":[25],"of":[26,36,38,44],"syntactic":[27,40],"phenomena,":[28],"an":[30],"defines":[33],"the":[34,39,53],"domain":[35],"locality":[37],"and":[41],"semantic":[42],"dependencies":[43],"its":[45],"items.":[47],"It":[48],"has":[49],"been":[50],"claimed":[51],"in":[52],"literature":[54],"that":[55,70],"for":[56],"every":[57],"grammar,":[59],"one":[60],"can":[61],"construct":[62],"strongly":[64],"equivalent":[65],"version.":[67],"We":[68],"show":[69],"such":[71],"procedure":[73],"does":[74],"not":[75,80],"exist:":[76],"Tree-adjoining":[77],"closed":[81],"under":[82],"strong":[83],"lexicalization.":[84]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}