{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:32:43Z","timestamp":1648967563762},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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":[[1999,12]]},"abstract":"<jats:p>Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad \ncoverage grammars. In the simplest case, rules can simply be \u2018read off\u2019 the parse-annotations of \nthe corpus, producing either a simple or probabilistic context-free grammar. Such grammars, \nhowever, can be very large, presenting problems for the subsequent computational costs of \nparsing under the grammar. In this paper, we explore ways by which a treebank grammar \ncan be reduced in size or \u2018compacted\u2019, which involve the use of two kinds of technique: (i) \n<jats:italic>thresholding<\/jats:italic> of rules by their number of occurrences; and (ii) a method of <jats:italic>rule-parsing<\/jats:italic>, which \nhas both probabilistic and non-probabilistic variants. Our results show that by a combined \nuse of these two techniques, a probabilistic context-free grammar can be reduced in size by \n62% without any loss in parsing performance, and by 71% to give a gain in recall, but some \nloss in precision.<\/jats:p>","DOI":"10.1017\/s1351324900002308","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:30:22Z","timestamp":1027762222000},"page":"377-394","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating two methods for Treebank grammar compaction"],"prefix":"10.1017","volume":"5","author":[{"given":"ALEXANDER","family":"KROTOV","sequence":"first","affiliation":[]},{"given":"MARK","family":"HEPPLE","sequence":"additional","affiliation":[]},{"given":"ROBERT","family":"GAIZAUSKAS","sequence":"additional","affiliation":[]},{"given":"YORICK","family":"WILKS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1999,12,1]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324900002308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:41:05Z","timestamp":1557416465000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324900002308\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S1351324900002308"],"URL":"https:\/\/doi.org\/10.1017\/s1351324900002308","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}