Cover Image

A Fast Algorithm for Computing Prefix Probabilities

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nowak, Franz, Cotterell, Ryan
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
by: Taylor, Landon, et al.
Published: (2025)

Algorithmical Aspects of Some Bio Inspired Operations
by: Dumitran, Marius
Published: (2025)

Language Edit Distance & Scored Parsing: Faster Algorithms & Connection to Fundamental Graph Problems
by: Kociumaka, Tomasz, et al.
Published: (2014)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
by: Inenaga, Shunsuke, et al.
Published: (2024)

A closer look at TDFA
by: Borsotti, Angelo, et al.
Published: (2022)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
by: Gawrychowski, Pawel, et al.
Published: (2024)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Dynamic Membership for Regular Tree Languages
by: Amarilli, Antoine, et al.
Published: (2025)

On Minimizers of Minimum Density
by: Shur, Arseny
Published: (2025)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
by: Manea, Florin, et al.
Published: (2025)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
by: Amarilli, Antoine, et al.
Published: (2026)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
by: Inenaga, Shunsuke
Published: (2024)

Out-of-Order Membership in Regular Languages
by: Amarilli, Antoine, et al.
Published: (2026)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
by: Amarilli, Antoine, et al.
Published: (2024)

Distinct Shortest Walk Enumeration for RPQs
by: David, Claire, et al.
Published: (2023)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)

Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)

Tokenisation is NP-Complete
by: Whittington, Philip, et al.
Published: (2024)

Symbolic Functional Decomposition: A Reconfiguration Approach
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
by: Bringmann, Karl, et al.
Published: (2023)

Hardness of Regular Expression Matching with Extensions
by: Nogami, Taisei, et al.
Published: (2026)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Finding Diverse Strings and Longest Common Subsequences in a Graph
by: Shida, Yuto, et al.
Published: (2024)

Optimal Sequential Flows
by: Gimbert, Hugo, et al.
Published: (2025)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
by: Ingels, Florian, et al.
Published: (2025)

Learning Algorithms in the Limit
by: Papazov, Hristo, et al.
Published: (2025)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
by: Cotumaccio, Nicola
Published: (2023)