Spectral Learning for Non-Deterministic Dependency Parsing

Spectral Dependency Parsing with Latent Variables

Non-Deterministic Oracles for Unrestricted Non-Projective Transition-Based Dependency Parsing

Combining Discrete and Continuous Features for Deterministic Transition-based Dependency Parsing

Language Independent Dependency to Constituent Tree Conversion

We present a dependency to constituent tree conversion technique that aims to improve constituent parsing accuracies by leveraging dependency treebanks available in a wide variety in many languages. The technique works i…

Identifiability and Unmixing of Latent Parse Trees

This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on th…