98 citations · 562 across the 50 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CL2023
Efficient Semiring-Weighted Earley Parsing
Andreas Opedal, Ran Zmigrod, Tim Vieira +2
This paper provides a reference description, in the form of a deduction system, of Earley's (1970) context-free parsing algorithm with various speed-ups. Our presentation includes…
cs.CL2023
Hexatagging: Projective Dependency Parsing as Tagging
Afra Amini, Tianyu Liu, Ryan Cotterell
We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In con…
cs.DS2023
Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs
Anej Svete, Benjamin Dayan, Tim Vieira +2
Weighted finite-state automata (WSFAs) are commonly used in NLP. Failure transitions are a useful extension for compactly representing backoffs or interpolation in -gram models…