As of May 31, 2023, we have updated our Code of Conduct.

Questions tagged [context-free-grammars]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1 vote
0 answers

Freely available Penn-Treebank-like Rewriting Rules corpus?

Hey I'm currently working on my thesis in computer science. For one of my experiments I need a large context-free grammar (set of rewriting rules) that vastly approximates English syntax for some ...
ChomskyEnjoyer's user avatar
0 votes
0 answers

Approximate context-free model for English?

I believe a similar question has been asked before, but it still has no answers: *Compact* Context-Free Grammar for English I would like to know where you can find a set of context-free production ...
Aiman Al Masoud's user avatar
1 vote
1 answer

What language does S -> A generates?

I read formal grammar's definition from Wikipedia, and it seems like there can be such a grammar like: S -> A //no more rules S and A are both non-terminals. What language does it generates? I've ...
kjh6b6a68's user avatar
  • 129
2 votes
0 answers

*Compact* Context-Free Grammar for English

I have seen that similar questions have been asked here, but the common answer is to look at Generalized Phrase Structure Grammar. Then, on the internet I just find slides from computational ...
a_gdevr's user avatar
  • 44
2 votes
1 answer

Is English modeled as a deterministic CFL or a CFL?

Books on linguistics and NLP often mention that English is modeled by context free grammars, but also is parsed by LR(k) parsers. LR(k) parsers are for parsing deterministic CFLs, while CFLs are ...
Tim's user avatar
  • 375
2 votes
2 answers

Can CFG (context free phrase structure grammar) describe discontinuous constituents?

If you google search "discontinuous constituent", you will see that various extensions to CFG have been proposed to describe discontinuous constituents. One of them is found in my favorite book on ...
Greg Lee's user avatar
  • 12.3k
0 votes
3 answers

Natural languages, programming languages, and information theory

The background The use of the context-free grammars in linguistics often prompts comparison with programming languages (e.g., see this question). Despite the formal structure similarities, I would ...
Roger Vadim's user avatar