Am I writing software for the open source ontology engine?

No, I want others to write it, once others own it then they will market it. I have written too many ontology engines in my time, they are simple. I have a design, I have gotten the main loop to about 50 lines of code, and another 300 to cover the core syntax. My main job is to keep the lines of code below 500, total release.

The design is patent free, and its implementation by two or three researchers over 30 years ago means it is fully protected by prior art.

Handling text in the engine
Ontologies are mainly words, language words. But world is made of blobs of text in various formats. Id the ontology engines requires and outside world cloud converter, to extract words, then we have just made more work for the user. Out Typeface Explosion language works just as well with characters as words, but we don;t want to make SQL records out of every character we see. What to do?

SQL poduces a text string, even a text blob. So we create an operator that explodes text, incrementally, by just moving the cursor down the text string. Let's define the quote operator again as a text exploder:

Gout - convolve('<.*.>',Htmlfiles)

This explores all html files as exploded text and collects the html key words. The quotes mean the matches are in text nodes treated as character ontology graphs. This only adds a few lines of code. The matching nodes in Html files will not match unless they are SQL text blobs. So just load up the HTML files as single record text blobs, in nested order records, and they can be processed in the ontology engine. In the TE scripts, write convolutions that makes words, phrases, and ontologies out of the text.

Let's define the not match operator. Whenever the match is found, is is passed without pushing Gout. As in:

Gout = convolve((!'<.*.>,*'),Htmlfiles)
Which collect everything except the html keywords. The not operator is the exclamation point, as in the c language. However, dealing with text as character arrays, we will need a concatenate operator to assemble key wodss. Ultimately, concatenate characters onto the current G node string until white space is reached. We can easily do that.