W08-2135 unlikely argument candidates in a dependency-based parsing tree . Given a dependency parsing
P97-1003 recently been interest in using dependency-based parsing models in speech recog - nition
E97-1003 recently been interest in using dependency-based parsing models in speech recog - nition
W08-2135 experiment , it also works on dependency-based parsing . 3 Bilayer Maximum Entropy Markov
W98-0509 decision criteria . Interestingly , dependency-based parsing can be viewed as a generalized
J13-1003 research efforts on data-driven dependency-based parsing ( K ¨ ubler , McDonald ,
W13-4917 nonetheless . We start by reviewing dependency-based parsing results , both on the trees and
J08-3003 Hajiˇc et al. 2001 ) . Recently , dependency-based parsing has been applied to 13 different
J08-3003 In this article , we focus on dependency-based parsing of Turkish , a language that
P92-1041 errors . First , it is shown how dependency-based parsing can be afforded , by taking into
P99-1076 see how this could be adapted to dependency-based parsing . <title> TextTiling VecTile
W05-0908 F-score measure that is adapted from dependency-based parsing ( Crouch et al. , 2002 ) and
W05-0908 adapts evaluation techniques from dependency-based parsing ( Crouch et al. , 2002 ) and
A97-1011 restriction is present in many dependency-based parsing systems ( McCord , 1990 ; Sleator
P06-2066 without compromising efficiency . In dependency-based parsing , several constraints have been
hide detail