Approximate matching between a context-free grammar and a finite-state automaton (Q259082)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate matching between a context-free grammar and a finite-state automaton |
scientific article |
Statements
Approximate matching between a context-free grammar and a finite-state automaton (English)
0 references
10 March 2016
0 references
approximate matching
0 references
edit distance
0 references
gap penalty
0 references
context-free grammars
0 references
finite-state automata
0 references
