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.
2015
2015
Graph-Based Lexicon Regularization for PCFG With Latent Annotations
This paper aims at learning a better probabilistic context-free grammar with latent annotations (PCFG-LA) by using a graph… 
2014
2014
Syntax-Augmented Machine Translation using Syntax-Label Clustering
Recently, syntactic information has helped significantly to improve statistical machine translation. However, the use of… 
1997
1997
The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions
1997
1997
Adjunction As Substitution: An Algebraic Formulation of Regular Context-Free and Tree Adjoining Languages
This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts… 
1996
1996
Towards Automatic Grammar Acquisition from a Bracketed Corpus
1 I n t r o d u c t i o n Designing and refining a natural language grammar is a diiBcult and time-consuming task and requires a… 
1992
1992
DCT-based codebook design for vector quantization of images
  • C. Hsieh
  • IEEE Trans. Circuits Syst. Video Technol.
  • 1992
  • Corpus ID: 44672669
A codebook design algorithm based on a two-dimensional discrete cosine transform (2-D DCT) is presented for vector quantization… 
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… 
1987
1987
Nonterminal Separating Macro Grammars
We extend the concept of nonterminal separating (or NTS) context-free grammar to nonterminal separating $m$-macro grammar where… 
1970
1970
Stochastic sources for context-free languages
The concept of a stochastic source of a context-free language is presented and one possible source model based on a probabilistic… 
1967
1967
An Analog of a Theorem about Contex-Free 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)