{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:00:30Z","timestamp":1648951230065},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T00:00:00Z","timestamp":1135209600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p>There has been a contemporary surge of interest in the application of stochastic models of parsing. The use of tree-adjoining grammar (TAG) in this domain has been relatively limited due in part to the unavailability, until recently, of large-scale corpora hand-annotated with TAG structures. Our goals are to develop inexpensive means of generating such corpora and to demonstrate their applicability to stochastic modeling. We present a method for automatically extracting a linguistically plausible TAG from the Penn Treebank. Furthermore, we also introduce labor-inexpensive methods for inducing higher-level organization of TAGs. Empirically, we perform an evaluation of various automatically extracted TAGs and also demonstrate how our induced higher-level organization of TAGs can be used for smoothing stochastic TAG models.<\/jats:p>","DOI":"10.1017\/s1351324905003943","type":"journal-article","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T09:22:54Z","timestamp":1135243374000},"page":"251-299","source":"Crossref","is-referenced-by-count":8,"title":["Automated extraction of Tree-Adjoining Grammars from treebanks"],"prefix":"10.1017","volume":"12","author":[{"given":"JOHN","family":"CHEN","sequence":"first","affiliation":[]},{"given":"SRINIVAS","family":"BANGALORE","sequence":"additional","affiliation":[]},{"given":"K.","family":"VIJAY-SHANKER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2005,12,22]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324905003943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T19:31:36Z","timestamp":1554060696000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324905003943\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,22]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["S1351324905003943"],"URL":"https:\/\/doi.org\/10.1017\/s1351324905003943","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,22]]}}}