Pages that link to "Item:Q4074401"
From MaRDI portal
The following pages link to A Method for the Correction of Garbled Words Based on the Levenshtein Metric (Q4074401):
Displayed 9 items.
- Constrained string editing (Q1099954) (← links)
- The use of context in pattern recognition (Q1247177) (← links)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Optimal matching of deformed patterns with positional influence (Q1822516) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- A common basis for similarity measures involving two strings† (Q3962481) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)