Approximate matching between a context-free grammar and a finite-state automaton (Q5327490)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6196399
| 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 6196399 |
Statements
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (English)
0 references
7 August 2013
0 references
approximate matching
0 references
edit-distance
0 references
context-free grammars
0 references
finite-state automata
0 references
0.98393315076828
0 references
0.8464542627334595
0 references
0.8429135680198669
0 references
0.8378437757492065
0 references
0.8055490255355835
0 references
