7 papers
Exact Paired-Permutation Testing for Structured Test Statistics
Ran Zmigrod, Tim Vieira, Ryan Cotterell
Significance testing -- especially the paired-permutation test -- has played a vital role in developing NLP systems to provide confidence that the difference in performance between…
On Finding the -best Non-projective Dependency Trees
Ran Zmigrod, Tim Vieira, Ryan Cotterell
The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependenc…
Please Mind the Root: Decoding Arborescences for Dependency Parsing
Ran Zmigrod, Tim Vieira, Ryan Cotterell
The connection between dependency trees and spanning trees is exploited by the NLP community to train and to decode graph-based dependency parsers. However, the NLP literature has…
Efficient Computation of Expectations under Spanning Tree Distributions
Ran Zmigrod, Tim Vieira, Ryan Cotterell
We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations i…
SIGMORPHON 2020 Shared Task 0: Typologically Diverse Morphological Inflection
Ekaterina Vylomova, Jennifer White, Elizabeth Salesky +25
A broad goal in natural language processing (NLP) is to develop a system that has the capacity to process any natural language. Most systems, however, are developed using data from…
Information-Theoretic Probing for Linguistic Structure
Tiago Pimentel, Josef Valvoda, Rowan Hall Maudslay +3
The success of neural networks on a diverse set of NLP tasks has led researchers to question how much these networks actually ``know'' about natural language. Probes are a natural…