Home
People
Publications
Teaching
Thesis Projects
Reading Group
Talks
Joining
Tim Vieira
Latest
The Foundations of Tokenization: Statistical and Computational Concerns
An Exploration of Left-Corner Transformations
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages
A Formal Perspective on Byte-Pair Encoding
Efficient Semiring-Weighted Earley Parsing
Efficient Semiring-Weighted Earley Parsing
On the Intersection of Context-Free and Regular Languages
Algorithms for Weighted Finite-State Automata with Failure Arcs
Algorithms for Weighted Pushdown Automata
Exact Paired-Permutation Testing for Structured Test Statistics
On the Intersection of Context-Free and Regular Languages
Conditional Poisson Stochastic Beam Search
Conditional Poisson Stochastic Beam Search
Conditional Poisson Stochastic Beams
Efficient Sampling of Dependency Structure
Efficient Sampling of Dependency Structure
Efficient Sampling of Dependency Structure
Searching for More Efficient Dynamic Programs
Searching for More Efficient Dynamic Programs
Searching for More Efficient Dynamic Programs
Higher-order Derivatives of Weighted Finite-state Machines
On Finding the $K$-best Non-projective Dependency Trees
On Finding the $K$-best Non-projective Dependency Trees
Efficient Computation of Expectations under Spanning Tree Distributions
If Beam Search is the Answer, What was the Question?
Please Mind the Root: Decoding Arborescences for Dependency Parsing
Best-First Beam Search
Efficient Computation of Expectations under Spanning Tree Distributions
Speed-Accuracy Tradeoffs in Tagging with Variable-Order CRFs and Structured Sparsity
A Joint Model of Orthography and Morphological Segmentation
Cite
×