Skip to search formSkip to main contentSkip to account menu

Terminal and nonterminal symbols

Known as: Terminal, Terminal symbol, Nonterminal 
In computer science, terminal and nonterminal symbols are the lexical elements used in specifying the production rules constituting a formal grammar… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Computer scienceContext-free grammarEarley parserEmpty string

Broader (1)

Pattern matching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Improving Syntax-Augmented Machine Translation by Coarsening the Label Set
We present a new variant of the SyntaxAugmented Machine Translation (SAMT) formalism with a category-coarsening algorithm… 
2011
2011
CCG Contextual labels in Hierarchical Phrase-Based SMT
In this paper, we present a method to employ target-side syntactic contextual information in a Hierarchical Phrase-Based system… 
Highly Cited
2008
Highly Cited
2008
Conjunctive Grammars Can Generate Non-regular Unary Languages
Conjunctive grammars were introduced by A. Okhotin in [1] as a natural extension of context-free grammars with an additional… 
Highly Cited
2007
Highly Cited
2007
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a… 
2004
2004
Degrees of Contrast and the Topic-Focus Articulation
The aim of the present contribution is to present s veral hypotheses that may help to characterize and identify contrast as such… 
2003
2003
Role of Architecture on the Conformation, Rheology, and Orientation Behavior of Linear, Star, and Hyperbranched Polymer Melts. 2. Linear Viscoelasticity and Flow Birefringence
In the preceding publication, we showed that the hyperbranched polystyrenes (HBPS) synthesized as part of this study may be… 
Highly Cited
2001
Highly Cited
2001
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
We improve the results elaborated in [6] on the number of non-terminal symbols needed in matrix grammars, programmed grammars… 
Highly Cited
1994
Highly Cited
1994
Context-Sensitive Statistics For Improved Grammatical Language Models
We develop a language model using probabilistic context-free grammars (PCFGs) that is "pseudo context-sensitive" in that the… 
Review
1992
Review
1992
Book Reviews: Generalized LR Parsing
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… 
Highly Cited
1990
Highly Cited
1990
Two Principles of Parse Preference
The DIALOGIC system for syntactic analysis and semantic translation has been under development for over ten years, and during… 
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)