10 citations · 11 across the 4 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CL2021★ 1 cited
Efficient Sampling of Dependency Structures
Ran Zmigrod, Tim Vieira, Ryan Cotterell
Probabilistic distributions over spanning trees in directed graphs are a fundamental model of dependency structure in natural language processing, syntactic dependency trees. In NL…
cs.CL2021
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…
cs.CL2021
Higher-order Derivatives of Weighted Finite-state Machines
Ran Zmigrod, Tim Vieira, Ryan Cotterell
Weighted finite-state machines are a fundamental building block of NLP systems. They have withstood the test of time -- from their early use in noisy channel models in the 1990s up…