5 research outputs found

    Transition-based dependency parsing as latent-variable constituent parsing

    Get PDF
    We provide a theoretical argument that a common form of projective transition-based dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable assumptions, a transition-based dependency parser can be converted to a latent-variable context-free grammar producing equivalent structures.Postprin

    Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time

    Get PDF
    We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as dynamic oracle. Unlike existing algorithms, it is applicable if the training corpus contains non-projective structures. We then show that for a projective training corpus, the time complexity can be improved from cubic to linear.Publisher PDFPeer reviewe

    Transforming Projective Bilexical Dependency Grammars into Efficiently-Parsable CFGs with Unfold-Fold

    No full text
    8 page(s
    corecore