I'm going to cc the mailing list.
Hi Linas,
Just wondering, is it possible to combine multiple words in right-star queries? I believe it would make the system equivalent to that GPT thing.
Sure. The GPT-thing uses skip-grams; the system here uses disjuncts aka "connector sets". The whole point is to extract grammatical structure.
Caution: The GPT thing is trained on billions of sentences, and requires petabytes of RAM, something I don't have. On the other hand, I suspect opencog/learn is smaller and more accurate than GPT, but I cannot prove this. It's just a guess.
Anyway, visualizing disjuncts is a stepping stone. Let me show examples:
+---------Ost--------+
+----->WV---->+ +------Ds**c------+ +----Js---+
+-->Wd--+<SFst+ | +----Am----+---Mf--+ +--Ds-+
| | | | | | | | |
LEFT-WALL here is.v a longer.a-c statement.n of some kind.n
Here are two incomplete sentences:
+----->WV---->+ +------Ds**c------+ +->>> ???
+-->Wd--+<SFst+ | +----Am----+---Mf--+
| | | | | | |
LEFT-WALL here is.v a longer.a-c statement.n of
+------Ost---->>> ???
+----->WV---->+ +----Ds**c-->>> ???
+-->Wd--+<SFst+ |
| | | |
LEFT-WALL here is.v a
Here is a single disjunct:
<<<------Ost--------+
<<<---Ds**c------+
<<<-Am----+---Mf-->>>
|
statement.n
Here is the Atomese for it:
(Section
(Word "statement.n")
(ConnectorSeq
(Connector (Link "Ost") (Dir "-"))
(Connector (Link "Ds**c") (Dir "-"))
(Connector (Link "Am") (Dir "-"))
(Connector (Link "Mf") (Dir "+"))))
This can be written as s string, much more compactly:
statement.n: Ost- & Ds**c- & Am- & Mf+;
Amir has created a system where you can type in sentences with wild-cards, and it will auto-complete them for you. The above three examples would be:
"Here is a longer statement of * *"
"Here is a * * * * *"
"* * * * statement * * *"
You can put the holes anywhere: "here is a * statement of * *" or "* * a longer statement * * kind" and it will "fill in the blanks".
Anyway, now you understand why I am interested in visualizing the disjuncts and tracing around in them.
-- linas