However , more recent work ( Cahill et al. 2002 ; Cahill , McCarthy , et al. 2004 ) has presented efforts in evolving and scaling up annotation techniques to the Penn-II Treebank ( Marcus et al. 1994 ) , containing more than 1,000,000 words and 49,000 sentences .
the penn treebank annotating predicate argument structure
Mitchell Marcus Grace Kim Mary Ann Marcinkiewicz Robert MacIntyre Mark Ferguson Karen Katz Britta Schasberger
Most of the early work on automatic f-structure annotation ( e.g. , van Genabith , Way , and Sadler 1999 ; Frank 2000 ; Sadler , van Genabith , and Way 2000 ) was applied only to small data sets ( fewer than 200 sentences ) and was largely proof of concept . However , more recent work ( Cahill et al. 2002 ; Cahill , McCarthy , et al. 2004 ) has presented efforts in evolving and scaling up annotation techniques to the Penn-II Treebank ( Marcus et al. 1994 ) , containing more than 1,000,000 words and 49,000 sentences . We utilize the automatic annotation algorithm of Cahill et al. ( 2002 ) and Cahill , McCarthy , et al. ( 2004 ) to derive a version of Penn-II in which each node in each tree is annotated with LFG functional annotations in the form of attribute-value structure equations .
However , more recent work ( Cahill et al. 2002 ; Cahill , McCarthy , et al. 2004 ) has presented efforts in evolving and scaling up annotation techniques to the Penn-II Treebank ( @@CITATION ) , containing more than 1,000,000 words and 49,000 sentences .