{"id":"https://openalex.org/W2022744196","doi":"https://doi.org/10.1017/s1351324905003943","title":"Automated extraction of Tree-Adjoining Grammars from treebanks","display_name":"Automated extraction of Tree-Adjoining Grammars from treebanks","publication_year":2005,"publication_date":"2005-12-22","ids":{"openalex":"https://openalex.org/W2022744196","doi":"https://doi.org/10.1017/s1351324905003943","mag":"2022744196"},"language":"en","primary_location":{"id":"doi:10.1017/s1351324905003943","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324905003943","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101650717","display_name":"John Chen","orcid":"https://orcid.org/0000-0002-9443-4795"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["CN","US"],"is_corresponding":true,"raw_author_name":"JOHN CHEN","raw_affiliation_strings":["Microsoft Research Asia, No. 49 Zhichun Road, Haidian District, Beijing 100080, China e-mail:","Microsoft Research Asia, No. 49 Zhichun Road, Haidian District, Beijing 100080, China e-mail: t-Johnc@microsoft.com"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia, No. 49 Zhichun Road, Haidian District, Beijing 100080, China e-mail:","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia, No. 49 Zhichun Road, Haidian District, Beijing 100080, China e-mail: t-Johnc@microsoft.com","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111475783","display_name":"Srinivas Bangalore","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SRINIVAS BANGALORE","raw_affiliation_strings":["AT&T Labs\u2013Research, P.O. Box 971, 180 Park Avenue, Florham Park, NJ 07932, USA e-mail:","AT&T Labs\u2013\u2013Research, P.O. Box 971, 180 Park Avenue, Florham Park, NJ 07932, USA e-mail: srini@research.att.com"],"affiliations":[{"raw_affiliation_string":"AT&T Labs\u2013Research, P.O. Box 971, 180 Park Avenue, Florham Park, NJ 07932, USA e-mail:","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Labs\u2013\u2013Research, P.O. Box 971, 180 Park Avenue, Florham Park, NJ 07932, USA e-mail: srini@research.att.com","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027009667","display_name":"K. Vijay\u2010Shanker","orcid":"https://orcid.org/0000-0003-0958-3073"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. VIJAY-SHANKER","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA e-mail:","Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA e-mail: vijay@cis.udel.edu"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA e-mail:","institution_ids":["https://openalex.org/I86501945"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA e-mail: vijay@cis.udel.edu","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101650717"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"],"apc_list":null,"apc_paid":null,"fwci":4.3876,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9421602,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"3","first_page":"251","last_page":"299"},"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.9998000264167786,"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/T12031","display_name":"Speech and dialogue systems","score":0.9962999820709229,"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.9235342741012573},{"id":"https://openalex.org/keywords/treebank","display_name":"Treebank","score":0.9126540422439575},{"id":"https://openalex.org/keywords/unavailability","display_name":"Unavailability","score":0.6927196979522705},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6740667819976807},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6233768463134766},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.606217086315155},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5651972889900208},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5568406581878662},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5156225562095642},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.48245149850845337},{"id":"https://openalex.org/keywords/wordnet","display_name":"WordNet","score":0.4190859794616699},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.4108853340148926}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9235342741012573},{"id":"https://openalex.org/C206134035","wikidata":"https://www.wikidata.org/wiki/Q811525","display_name":"Treebank","level":3,"score":0.9126540422439575},{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.6927196979522705},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6740667819976807},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6233768463134766},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.606217086315155},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5651972889900208},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5568406581878662},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5156225562095642},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.48245149850845337},{"id":"https://openalex.org/C157659113","wikidata":"https://www.wikidata.org/wiki/Q533822","display_name":"WordNet","level":2,"score":0.4190859794616699},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.4108853340148926},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C200601418","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability 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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1351324905003943","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324905003943","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W78943221","https://openalex.org/W93278731","https://openalex.org/W120840286","https://openalex.org/W146318628","https://openalex.org/W168911176","https://openalex.org/W207701337","https://openalex.org/W1245227822","https://openalex.org/W1507020546","https://openalex.org/W1519201847","https://openalex.org/W1528941926","https://openalex.org/W1533459882","https://openalex.org/W1535015163","https://openalex.org/W1593239840","https://openalex.org/W1718065290","https://openalex.org/W1924403233","https://openalex.org/W1972573551","https://openalex.org/W1982944197","https://openalex.org/W1983843792","https://openalex.org/W1986543644","https://openalex.org/W2000654059","https://openalex.org/W2007260766","https://openalex.org/W2022050541","https://openalex.org/W2028114094","https://openalex.org/W2036289382","https://openalex.org/W2045646185","https://openalex.org/W2056287164","https://openalex.org/W2079326125","https://openalex.org/W2081349491","https://openalex.org/W2088020722","https://openalex.org/W2088198454","https://openalex.org/W2092654472","https://openalex.org/W2093647425","https://openalex.org/W2097484156","https://openalex.org/W2105947498","https://openalex.org/W2110651511","https://openalex.org/W2115389092","https://openalex.org/W2120084270","https://openalex.org/W2131986285","https://openalex.org/W2134237567","https://openalex.org/W2137806537","https://openalex.org/W2138389163","https://openalex.org/W2138433202","https://openalex.org/W2141063311","https://openalex.org/W2147332276","https://openalex.org/W2155149900","https://openalex.org/W2616709338","https://openalex.org/W2786259876","https://openalex.org/W2912179408","https://openalex.org/W2950925769"],"related_works":["https://openalex.org/W79811433","https://openalex.org/W1043255351","https://openalex.org/W2135057643","https://openalex.org/W2109902858","https://openalex.org/W1533278948","https://openalex.org/W1781980207","https://openalex.org/W2951759144","https://openalex.org/W28706907","https://openalex.org/W2949524199","https://openalex.org/W2017946383"],"abstract_inverted_index":{"There":[0],"has":[1,25],"been":[2,26],"a":[3,65,70],"contemporary":[4],"surge":[5],"of":[6,11,14,18,37,51,88,95,108],"interest":[7],"in":[8,22,30],"the":[9,33,75],"application":[10],"stochastic":[12,61,115],"models":[13],"parsing.":[15],"The":[16],"use":[17],"tree-adjoining":[19],"grammar":[20],"(TAG)":[21],"this":[23],"domain":[24],"relatively":[27],"limited":[28],"due":[29],"part":[31],"to":[32,47,56,60],"unavailability,":[34],"until":[35],"recently,":[36],"large-scale":[38],"corpora":[39,54],"hand-annotated":[40],"with":[41],"TAG":[42,73,116],"structures.":[43],"Our":[44],"goals":[45],"are":[46],"develop":[48],"inexpensive":[49],"means":[50],"generating":[52],"such":[53],"and":[55,100],"demonstrate":[57,102],"their":[58],"applicability":[59],"modeling.":[62],"We":[63],"present":[64],"method":[66],"for":[67,84,113],"automatically":[68,97],"extracting":[69],"linguistically":[71],"plausible":[72],"from":[74],"Penn":[76],"Treebank.":[77],"Furthermore,":[78],"we":[79,91],"also":[80,101],"introduce":[81],"labor-inexpensive":[82],"methods":[83],"inducing":[85],"higher-level":[86,106],"organization":[87,107],"TAGs.":[89],"Empirically,":[90],"perform":[92],"an":[93],"evaluation":[94],"various":[96],"extracted":[98],"TAGs":[99,109],"how":[103],"our":[104],"induced":[105],"can":[110],"be":[111],"used":[112],"smoothing":[114],"models.":[117]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}