Syntactic Graph

What is Syntactic Graph? This is the concept that replaces in Minimalist Framework “Parsing Tree” of earlier research. While the term “Syntactic Graph” was not used, the concept was introduced by Chomsky as part of radical simplification of syntactic theory.
When you build a syntactic object by recursively “merging” and “re-merging”, what you get is, mathematically speaking, a Graph.

Start with a list of Vertices (“Numeration”). Then gradually add directed Edges, removing from Numeration any Vertix pointed to by an Edge. Every time a new Edge is added, it must be from a Source in Numeration to a Goal which is either in Numeration OR accessible from Source. Entire algorithm for building Syntactic Objects in the Minimalist Framework is presented in this paragraph in terms of Graph Theory.

Adding an Edge pointing to a Vertix still in the Numeration is called “Merge”, to a Vertix already not in Numeration – is called “Re-Merge”. Existing Literature about Syntactic Graph is using the terminology of theoretical linguistics heavily.

Syntactic Graph feeds both (so-called) “Interfaces”: (a) phonological Spell-Out, (b) “Conceptual-Intentional” system(formerly Logical Form).

In Minimalist Framework, each word is usually represented (in Syntactic Graph) by a Vertix or two, with somewhat complex internal structure. Nanosyntax is further development of Minimalist Framework, at finer-grain resolution, with Syntactic Graph handling word-internal structure.

Syntactic Graph is the natural language for describing the meaning of natural language.

Representing text in computers by alphabetic characters is archaic technology – it already was ancient in Antiquity… The transition to using Syntactic Graph simply makes sense – scientifically valid representation of text and its meaning.