Skip to search formSkip to main contentSkip to account menu

Context-free grammar

Known as: Context-free grammars, CFG, Context Free Grammar 
A context-free grammar (CFG) is a term used in formal language theory to describe a certain type of formal grammar. A context-free grammar is a set… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ALGOL 68ANTLRAdaptive grammarAffix grammar

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Evaluating the Ability of LSTMs to Learn Context-Free Grammars
While long short-term memory (LSTM) neural net architectures are designed to capture sequence information, human language is… 
Highly Cited
2013
Highly Cited
2013
A group decision making model dealing with comparative linguistic expressions based on hesitant fuzzy linguistic term sets
Highly Cited
2011
Highly Cited
2011
Improved Grammar-Based Compressed Indexes
We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only… 
Highly Cited
2000
Highly Cited
2000
Learning Context-Free Grammars with a Simplicity Bias
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a… 
Highly Cited
1997
Highly Cited
1997
Context-Free Graph Grammars
Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph… 
Highly Cited
1993
Highly Cited
1993
A Dictionary of Grammatical Terms in Linguistics
This dictionary of grammatical terms covers both current and traditional terminology in syntax and morphology. It includes… 
Highly Cited
1991
Highly Cited
1991
Context-Free Grammar - Part 1
Summary. The concept of context-free grammar and of derivability in grammar are introduced. Moreover, the language (set of finite… 
Highly Cited
1987
Highly Cited
1987
An Efficient Augmented-Context-Free Parsing Algorithm
An efficient parsing algorithm for augmented context-free grammars is introduced, and its application to on-line natural language… 
Highly Cited
1972
Highly Cited
1972
Linear and Context-Free Graph Grammars
Topological characterizations of sets of graphs which can be generated by contextfree or linear grammars are given. It is shown… 
Highly Cited
1969
Highly Cited
1969
Programmed Grammars and Classes of Formal Languages
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)