W11-2912 HSP using the treebank 's full hybrid representation without preprocessing . In this
W11-2912 integrated model to parse the hybrid representation . For other parsing tasks , integrated
W11-2912 pure dependency . We recover the hybrid representation by reversing the transformations
W11-2912 dependency mode and recover the hybrid representation through a post-processing step
W11-2912 parser that is able to learn the hybrid representation without pre - processing . We
P11-2123 granularity in WordNet . As a hybrid representation , we also tested the effect of
P91-1044 the paper , I will argue that a hybrid representation formalism is best suited for
W11-2912 two-step approach converts the hybrid representation to pure dependency , we could
P89-1024 taxonomic reasoning to WML , giving a hybrid representation . 2.2 . Why a Taxonomic Language
W11-2912 dependency output is converted into the hybrid representation . This is compared to a novel
P89-1024 the diagram in Figure 1 in the hybrid representation are ( V x ) ( V r ) ( V w ) (
P89-1024 exploiting the domain model and hybrid representation system described in this paper
A97-1014 the corresponding nodes . This hybrid representation makes the structure less transparent
W11-2912 but is also better suited to the hybrid representation in the tree - bank . 7 Conclusion
W13-2406 analysis driven by this system . A hybrid representation , HT , that is based on DT but
H93-1081 Linker makes extensive use of the hybrid representation and interpretation component
W11-2912 the conversion process from the hybrid representation to pure dependency , and then
W15-1513 be inexpensively composed into hybrid representations , effectively leveraging strengths
W11-2912 statistical classifiers . For parsing hybrid representations , Hall and Nivre ( 2008 ) adapt
J11-2003 representations ( as well as from some hybrid representations ) and then combine them using
hide detail