Approximate matching between a context-free grammar and a finite-state automaton (Q259082)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate matching between a context-free grammar and a finite-state automaton |
scientific article; zbMATH DE number 6553704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate matching between a context-free grammar and a finite-state automaton |
scientific article; zbMATH DE number 6553704 |
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
0.98393315076828
0 references
0.8467565774917603
0 references
0.846265971660614
0 references
0.8435110449790955
0 references
0.826667070388794
0 references
