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… 
2009
2009
Treebank Grammar Techniques for Non-Projective Dependency Parsing
An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack… 
2005
2005
Grammar-based analysis of string expressions
We specify a polymorphic type system for an applied lambda calculus that refines the string type with a subtype hierarchy derived… 
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… 
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… 
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)