Tim Vieira
33 papers · 2012–2026 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Interdisciplinary Bridge π Renaissance Researcher (8) π Academic Marathon (13) π Conference Polyglot (8) πΊοΈ Taxonomy Completionist (37)
π§
Keyword Pioneer
π£
Hot Topic Early Bird
π
Conference Polyglot
(8)
π€
Dynamic Duo
(27)
β
The Questioner
β‘
Prolific Year
(6)
π
Century Club
(29)
ποΈ
Keyword Collector
(110)
π₯
Unstoppable
(6)
Conferences
EMNLP (14)
ACL (8)
ICLR (3)
ICML (2)
IJCNLP (2)
NAACL (2)
COLING (1)
EACL (1)
Top co-authors
Research topics
Keywords
context-free grammar
(5)
dependency parsing
(5)
spanning tree
(4)
beam search
(3)
parsing algorithm
(3)
formal language
(3)
conditional random field
(3)
k-best decoding
(2)
higher-order derivative
(2)
conditional poisson sampling
(2)
computational complexity
(2)
graph algorithm
(2)
language model
(2)
weighted finite-state machine
(2)
directed graph
(2)
dynamic programming
(2)
sequence generation
(2)
complexity analysis
(2)
variance reduction
(2)
information density
(1)
Papers
Prefix Parsing is Just Parsing
ACL 2026
On the Proper Treatment of Units in Surprisal Theory
ACL 2026
Syntactic and Semantic Control of Large Language Models via Sequential Monte Carlo
ICLR 2025
Syntactic Control of Language Models by Posterior Inference
ACL 2025
From Language Models over Tokens to Language Models over Characters
ICML 2025
The Foundations of Tokenization: Statistical and Computational Concerns
ICLR 2025
Language Models over Canonical Byte-Pair Encodings
ICML 2025
Variational Best-of-N Alignment
ICLR 2025
On the Proper Treatment of Tokenization in Psycholinguistics
EMNLP 2024
Direct Preference Optimization with an Offset
ACL 2024
An Exploration of Left-Corner Transformations
EMNLP 2023
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages
EMNLP 2023
Efficient Semiring-Weighted Earley Parsing
ACL 2023
A Formal Perspective on Byte-Pair Encoding
ACL 2023
On the Intersection of Context-Free and Regular Languages
EACL 2023
Algorithms for Weighted Pushdown Automata
EMNLP 2022
Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs
EMNLP 2022
Exact Paired-Permutation Testing for Structured Test Statistics
NAACL 2022
On Finding the K-best Non-projective Dependency Trees
ACL 2021
Efficient Sampling of Dependency Structure
EMNLP 2021
Conditional Poisson Stochastic Beams
EMNLP 2021
On Finding the K-best Non-projective Dependency Trees
IJCNLP 2021
Higher-order Derivatives of Weighted Finite-state Machines
IJCNLP 2021
Higher-order Derivatives of Weighted Finite-state Machines
ACL 2021
Conditional Poisson Stochastic Beam Search
EMNLP 2021
Efficient Sampling of Dependency Structures
EMNLP 2021
Searching for More Efficient Dynamic Programs
EMNLP 2021
Please Mind the Root: Decoding Arborescences for Dependency Parsing
EMNLP 2020
If beam search is the answer, what was the question?
EMNLP 2020
Speed-Accuracy Tradeoffs in Tagging with Variable-Order CRFs and Structured Sparsity
EMNLP 2016
Universal Decompositional Semantics on Universal Dependencies
EMNLP 2016
A Joint Model of Orthography and Morphological Segmentation
NAACL 2016
Grammarless Parsing for Joint Inference
COLING 2012