Pages that link to "Item:Q1403072"
From MaRDI portal
The following pages link to Fast string correction with Levenshtein automata (Q1403072):
Displaying 20 items.
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- A model and a fast algorithm for multiple errors spelling correction (Q808697) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- Quantitative monitoring of STL with edit distance (Q1667648) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Property-directed verification and robustness certification of recurrent neural networks (Q2147216) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Levenshtein graphs: resolvability, automorphisms \& determining sets (Q2689484) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- Computation of Similarity—Similarity Search as Computation (Q3091457) (← links)
- Fast Approximate Search in Large Dictionaries (Q3225420) (← links)
- Planning to Chronicle (Q3381972) (← links)
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Evaluation of string comparators for record linkage in Chinese environment (Q5052914) (← links)
- A succinct four Russians speedup for edit distance computation and one-against-many banded alignment (Q5140776) (← links)
- Volume formula and growth rates of the balls of strings under the edit distances (Q6096340) (← links)
- Differential privacy for symbolic systems with application to Markov chains (Q6160739) (← links)
