EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
From MaRDI portal
(Redirected from Publication:5696947)
Recommendations
- scientific article; zbMATH DE number 1962763
- Linear-space computation of the edit-distance between a string and a finite automaton
- Weighted automata computation of edit distances with consolidations and fragmentations
- Computing the edit distance of a regular language
- How hard is computing the edit distance?
Cites work
- A computational method for optimal control of a linear system by quadratic programming†
- Algorithms for approximate string matching
- Algorithms on Strings, Trees and Sequences
- An \(O(ND)\) difference algorithm and its variations
- An Improved Algorithm For Approximate String Matching
- Asynchronous sliding block maps
- Biological Sequence Analysis
- Fast parallel and serial approximate string matching
- GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Incremental String Comparison
- Sur une variante des fonctions séquentielles
- Synchronized rational relations of finite and infinite words
- The design principles of a weighted finite-state transducer library
- The String-to-String Correction Problem
Cited in
(40)- Quantitative monitoring of STL with edit distance
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- Weighted automata computation of edit distances with consolidations and fragmentations
- Symbolic weighted language models, quantitative parsing and automated music transcription
- Computing the edit distance of a regular language
- Learning stochastic edit distance: application in handwritten character recognition
- Approximate matching between a context-free grammar and a finite-state automaton
- Computing the expected edit distance from a string to a PFA
- Prefix distance between regular languages
- Edit-distance between visibly pushdown languages
- Edit distance for timed automata
- The Cost of Traveling between Languages
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- scientific article; zbMATH DE number 2089060 (Why is no real title available?)
- Linear-space computation of the edit-distance between a string and a finite automaton
- N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS
- Edit distance for pushdown automata
- Scoring Matrices That Induce Metrics on Sequences
- A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer
- 3-Way Composition of Weighted Finite-State Transducers
- Bounded repairability of word languages
- A coalgebraic perspective on linear weighted automata
- scientific article; zbMATH DE number 1962763 (Why is no real title available?)
- Computing the expected edit distance from a string to a probabilistic finite-state automaton
- Descriptional complexity of error detection
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- On the definition of stochastic λ-transducers
- Deciding word neighborhood with universal neighborhood automata
- The edit-distance between a regular language and a context-free language
- On implementing recognizable transductions
- Input-driven pushdown automata for edit distance neighborhood
- Edit distance neighbourhoods of input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- Weak inverse neighborhoods of languages
- Testing membership for timed automata
- A sum-over-paths extension of edit distances accounting for all sequence alignments
- Robust satisfaction of metric interval temporal logic objectives in adversarial environments
- Edit distance of finite state transducers
- A weak inverse of language neighborhoods and its properties
- Metrics for action-labelled quantitative transition systems
This page was built for publication: EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696947)
