A Gorn address (Gorn, 1967) is a method of identifying and addressing any
node
In general, a node is a localized swelling (a "knot") or a point of intersection (a vertex).
Node may refer to:
In mathematics
*Vertex (graph theory), a vertex in a mathematical graph
*Vertex (geometry), a point where two or more curves, lines, ...
within a
tree data structure
In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be connected to many children (depending on the type of tree), but must be conn ...
. This notation is often used for identifying nodes in a
parse tree
A parse tree or parsing tree or derivation tree or concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar. The term ''parse tree'' itself is used primarily in co ...
defined by
phrase structure rules
Phrase structure rules are a type of rewrite rule used to describe a given language's syntax and are closely associated with the early stages of transformational grammar, proposed by Noam Chomsky in 1957. They are used to break down a natural lang ...
.
The Gorn address is a sequence of zero or more integers conventionally separated by dots, e.g., ''0'' or ''1.0.1''.
The root which Gorn calls * can be regarded as the empty sequence.
And the
-th
child
A child ( : children) is a human being between the stages of birth and puberty, or between the developmental period of infancy and puberty. The legal definition of ''child'' generally refers to a minor, otherwise known as a person younger ...
of the
-th child has an address
, counting from 0.
It is named after American computer scientist
Saul Gorn
Saul Gorn (10 November 1912 – 22 February 1992) was an American pioneer in computer and information science who was a member of the School of Engineering and Applied Science at the University of Pennsylvania for more than 30 years.
Gorn was hir ...
.
References
*Gorn, S. (1967). Explicit definitions and linguistic dominoes. Systems and Computer Science, Eds. J. Hart & S. Takasu. 77-115. University of Toronto Press, Toronto Canada.
{{DEFAULTSORT:Gorn Address
Natural language processing