Splittability of Bilexical Context-Free Grammars is Undecidable
Saved in:
| Main Authors: | Mark-Jan Nederhof, Giorgio Satta |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The MIT Press
2021-03-01
|
| Series: | Computational Linguistics |
| Online Access: | http://dx.doi.org/10.1162/coli_a_00079 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Synchronous Context-Free Grammars and Optimal Parsing Strategies
by: Daniel Gildea, et al.
Published: (2021-03-01) -
Practical Experiments with Regular Approximation of Context-Free Languages
by: Mark-Jan Nederhof
Published: (2021-03-01) -
REDUCING GRAPHS BY LIFTING ROTATIONS OF EDGES TO SPLITTABLE GRAPHS
by: Vitaly Baransky, et al.
Published: (2024-12-01) -
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
by: Noah A. Smith, et al.
Published: (2021-03-01) -
Binarization of Synchronous Context-Free Grammars
by: Liang Huang, et al.
Published: (2021-03-01)