T2G

Text to Graph

I like this provocation provided by Eric Dobbs. When he created a tool that initially has only three structural kinds of parts he creates a kind of focused experimental space to consider semantic triples.

digraph { layout=dot rankdir=LR overlap=false concentrate=false bgcolor=lightblue // splines=" " node [shape=box style=rounded] label="Semantic Triple" Subject -> Predicate -> Object Subject -> Object [label=Predicate] }

Triples have a central place in semantics and computing.

What are the most fundamental types of relationships (verbs) with inputs and outputs of any function? This question leads us into category Theory a specialized use of graph theory.

Some serious people have made a case for avoiding "to be" in some or all its forms.

Is it useful to think of the "HERE NODE" as a function and the other nodes and relationships as inputs and outputs to the function. If so is the function a transformation?

I wonder what the intersection of linguistic triples (semantic triple) will be with Alexander's patterns and pattern languages? It certainly feels like his language has a three layered semantic structure connecting patterns to one another. Of course the pattern itself has semantics and structure. How interesting to explore.

What are the essential types of "HERE NODEs"? Can this be derived from the essential types of transformations needed for viability?

Would it be useful to have a graph write its page? This would be a reversal of the current method of having a page write a graph. This would be paring down the content from the original written page that wrote the graph.

# Key Verbs: Sensed Distinguishes Transforms Excludes Equals Caused by Produces

I will study E-prime Wikipedia to better understand the strongest way to handle a minimum number of connection types, morphisms.

Caused by Adjacency Heuristic, Category Theory. The cool thing is that all kinds of text can be added but only Pages are included in the graph.

Caused by Skilled Users, Use Cases

I just like the name "T2G" for Text to Graph. Eric's magic may go viral someday.

Sensed Input

Produces : I really like the way that this Consists of and emphasizes Links and Link Labels in addition to the more common emphasis on Nodes

Excludes Unlabeled Links.

Equals Text to Graph.

Produces Output References Explanations

DOT digraph rankdir=LR HERE NODE WHERE /^Caused by / edge [label="Causes" color=green penwidth=2] LINKS NODE -> HERE WHERE /^Sensed / edge [label="Sensed by" color=blue] LINKS NODE -> HERE WHERE /^Equals / edge [label="Equals" color=red penwidth=2] LINKS HERE -> NODE WHERE /^Produces / edge [label="Produces" color=black] LINKS HERE -> NODE WHERE /^Excludes / edge [label="Excludes" color=orange penwidth=2] LINKS HERE -> NODE STATIC digraph {rankdir=LR "T2G" edge [label="Causes" color=green penwidth=2] "Adjacency Heuristic" -> "T2G" "Category Theory" -> "T2G" "Pages" -> "T2G" "Skilled Users" -> "T2G" "Use Cases" -> "T2G" edge [label="Sensed" color=blue] "Input" -> "T2G" edge [label="Equals" color=red penwidth=2] "T2G" -> "Text to Graph" edge [label="Produces" color=black] "T2G" -> "Links" "T2G" -> "Link Labels" "T2G" -> "Nodes" edge [label="Excludes" color=orange penwidth=2] "T2G" -> "Unlabeled Links"}