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

String grammar

Known as: String-grammar 
The term "string grammar" in computational linguistics (and computer languages) refers to the structure of a specific language, such that it can be… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Abstract In some pattern recognition problems, the syntactic or structural information that describes each pattern is important… Expand
Is this relevant?
2015
2015
One of the popular classification problems is the syntactic pattern recognition. A syntactic pattern can be described using… Expand
  • table II
  • table I
  • table V
  • table VI
  • table VIII
Is this relevant?
2015
2015
Face recognition has become one of the important biometrics in many applications. However, there is a problem of collecting more… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table I
Is this relevant?
2009
2009
Tree based translation models are a compelling means of integrating linguistic information into machine translation. Syntax can… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
2008
2008
Esta tesis presenta una algebraizacion de las gramaticas de grafos, Desde el punto de vista de un ingeniero informatico, las… Expand
  • figure 2.7
  • figure 3.6
  • figure 3.8
  • figure 3.10
  • figure 3.12
Is this relevant?
2006
2006
This paper presents a combined approach for online handwriting symbols recognition. The basic idea of this approach is to employ… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • table 4
Is this relevant?
1995
1995
The aim of this paper is to elaborate the power of cooperation in generating pictures by array grammars. As it is expected, the… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
  • Kent Wittenburg
  • Proceedings IEEE Workshop on Visual Languages
  • 1992
  • Corpus ID: 314773
Predictive, Earley-style parsing for unrestricted relational grammars faces a number of problems not present in a context-free… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abstract Context-free hypergraph grammars generate the same string languages as deterministic tree-walking transducers. The… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1991
1991
We describe an advanced text processing system for information retrieval from natural language document collections. We use both… Expand
  • figure 3
  • figure 4
  • table 1
  • table 2
  • table 3
Is this relevant?