Finding the smallest binarization of a CFG is NP-hard (Q2637648)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the smallest binarization of a CFG is NP-hard |
scientific article |
Statements
Finding the smallest binarization of a CFG is NP-hard (English)
0 references
13 February 2014
0 references
natural language processing
0 references
complexity
0 references
binarization
0 references
grammars
0 references
context-free grammar
0 references
parsing
0 references
0 references
