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… (More)
Wikipedia

Related topics

Related topics

14 relations
Computer scienceContext-free grammarEarley parserEmpty string
(More)

Broader (1)

Pattern matching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Nonterminal complexity of tree controlled grammars
This paper studies the nonterminal complexity of tree controlled grammars. It is proved that the number of nonterminals in tree… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Dependency Parsing by Belief Propagation
We formulate dependency parsing as a graphical model with the novel ingredient of global constraints. We show how to apply loopy… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
2008
2008
Maximum Entropy based Rule Selection Model for Syntax-based Statistical Machine Translation
This paper proposes a novel maximum entropy based rule selection (MERS) model for syntax-based statistical machine translation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Packing element-disjoint steiner trees
Given an undirected graph <i>G</i>(<i>V</i>, <i>E</i>) with terminal set <i>T</i> ⊆ <i>V</i>, the problem of packing element… (More)
Is this relevant?
2002
2002
PCFG Learning by Nonterminal Partition Search
pcfg Learning by Partition Search is a general grammatical inference method for constructing, adapting and optimising pcfgs… (More)
  • figure 1
  • table 1
Is this relevant?
2000
2000
Generative power of three-nonterminal scattered context grammars
This paper discusses the descriptional complexity of scattered context grammars with respect to the number of nonterminals. It… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Prioritized Sweeping : Reinforcement Learning with Less Data and Less Real Time
We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Probabilistic Tree-Adjoining Grammar As A Framework For Statistical Natural Language Processing
In this paper, I argue for the use of a probabilistic form of tree-adjoining grammar (TAG) in statistical natural language… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1989
1989
On the identity of optimal strategies for multistage classifiers
This paper deals with the decision rules of a multistage classifier based on a decision tree scheme. Two optimal (Bayes… (More)
  • figure 2
Is this relevant?
Highly Cited
1968
Highly Cited
1968
Semantics of context-free languages
“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for… (More)
Is this relevant?