[updated with Tagommenders paper – thanks Shilad.] The organizers of the World Wide Web conference recently announced the list of accepted papers for this year’s event. In the Social Networks and Web 2.0 track (chaired by Elisa Bertino and Lada...
«Traditionally, unification grammars are hand-coded. This is extremely time consuming, expensive and very difficult to scale. [...] we have developed a new method for automatically extracting wide-coverage probabilistic unification (LFG) grammars from treebank resources. To achieve this, we first automatically annotate the treebank (such as Penn-II) with feature-structure information (LFG f-structures, approximating to basic predicate-argument structure). From the f-structure annotated treebank, we then automatically extract wide-coverage, probabilistic LFG approximations to parse new text»
M. Yuen, L. Chen, und I. King. Proceedings of the International Conference on Computational Science and Engineering, CSE '09, 4, Seite 723--728. (August 2009)