Efficient Sampling of Dependency Structures

by   Ran Zmigrod, et al.

Probabilistic distributions over spanning trees in directed graphs are a fundamental model of dependency structure in natural language processing, syntactic dependency trees. In NLP, dependency trees often have an additional root constraint: only one edge may emanate from the root. However, no sampling algorithm has been presented in the literature to account for this additional constraint. In this paper, we adapt two spanning tree sampling algorithms to faithfully sample dependency trees from a graph subject to the root constraint. Wilson (1996)'s sampling algorithm has a running time of π’ͺ(H) where H is the mean hitting time of the graph. Colbourn (1996)'s sampling algorithm has a running time of π’ͺ(N^3), which is often greater than the mean hitting time of a directed graph. Additionally, we build upon Colbourn's algorithm and present a novel extension that can sample K trees without replacement in π’ͺ(K N^3 + K^2 N) time. To the best of our knowledge, no algorithm has been given for sampling spanning trees without replacement from a directed graph.


page 1

page 2

page 3

page 4

βˆ™ 06/01/2021

On Finding the K-best Non-projective Dependency Trees

The connection between the maximum spanning tree in a directed graph and...
βˆ™ 05/25/2022

Unbiased and Efficient Sampling of Dependency Trees

Distributions over spanning trees are the most common way of computation...
βˆ™ 10/06/2020

Please Mind the Root: Decoding Arborescences for Dependency Parsing

The connection between dependency trees and spanning trees is exploited ...
βˆ™ 12/27/2021

How to choose the root: centrality measures over tree structures

Centrality measures are commonly used to analyze graph-structured data; ...
βˆ™ 07/04/2018

Tight bounds for popping algorithms

We sharpen run-time analysis for algorithms under the partial rejection ...
βˆ™ 01/24/2020

Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization

Given n points in the plane, we propose algorithms to compile connected ...
βˆ™ 04/09/2018

Maximizing the Number of Spanning Trees in a Connected Graph

We study the problem of maximizing the number of spanning trees in a con...

Please sign up or login with your details

Forgot password? Click here to reset