Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Recurrent neural network grammars (RNNG) are a recently proposed probabilistic generative modeling family for natural language… Expand
  • figure 1
  • table 3
  • table 4
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies… Expand
  • figure 4
  • table 1
  • table 2
  • figure 5
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Domain specific languages (DSLs) are increasingly used today. Coping with complex language definitions, evolving them in a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • D. Knuth
  • Mathematical systems theory
  • 2005
  • Corpus ID: 5182310
Abstract“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Three types of maleated polypropylene-lay- ered silicate nanocomposites with different dispersion states of layered silicate… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Thegrammar problem, a generalization of the single-source shortest-path problem introduced by D. E. Knuth (Inform. Process. Lett… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this paper, I argue for the use of a probabilistic form of tree-adjoining grammar (TAG) in statistical natural language… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
0~12 is a functional programming language with an underlying formal semantics that is based upon equational logic, and an… Expand
Is this relevant?