1 citations · 1 across the 5 of their papers we have counts for
5 papers
A Close Analysis of the Subset Construction
Ivan Baburin, Ryan Cotterell
Given a nondeterministic finite-state automaton (NFA), we aim to estimate the size of an equivalent deterministic finite-state automaton (DFA). We demonstrate that computing the st…
Correlation Does Not Imply Compensation: Complexity and Irregularity in the Lexicon
Amanda Doucette, Ryan Cotterell, Morgan Sonderegger +1
It has been claimed that within a language, morphologically irregular words are more likely to be phonotactically simple and morphologically regular words are more likely to be pho…
NARRATE: Versatile Language Architecture for Optimal Control in Robotics
Seif Ismail, Antonio Arbues, Ryan Cotterell +2
The impressive capabilities of Large Language Models (LLMs) have led to various efforts to enable robots to be controlled through natural language instructions, opening exciting po…
An Analysis of On-the-fly Determinization of Finite-state Automata
Ivan Baburin, Ryan Cotterell
In this paper we establish an abstraction of on-the-fly determinization of finite-state automata using transition monoids and demonstrate how it can be applied to bound the asympto…
Do Syntactic Probes Probe Syntax? Experiments with Jabberwocky Probing
Rowan Hall Maudslay, Ryan Cotterell
Analysing whether neural language models encode linguistic information has become popular in NLP. One method of doing so, which is frequently cited to support the claim that models…