Return the parent network. A network is essentially a nested-transactional sub-graph of the parent.

Return the target vertex related by the type, with the high consciousness level.

Create the word with the meaning.

Remove the relationships of the type.

Create the word with the meaning.

Unique id for the vertex. All vertices should define a unique identifier.

Return if the relationship is inverse, i.e. know to not exist.

Set the name of the vertex. The name is used as a hint to refer to what the vertex represents.

Return if the sense is enabled.

Return all of the relationships targets of the primitive type, sorted by index.

Compare if the two vertices match. 0 means perfect match. -n means n relationships that do not match. +n means n relationships that do match.

Return the state of mind.

Merge the short term memory into the long term and clears the short term. This is similar to a transactional commit. The changes should also be persis

Return any relationship target of the primitive type.

Replace reserved HTML character with their HTML escape codes.

* Used for debugging */

Tokenize the sentence into its words and create a vertex representation.

Set the name of the vertex. The name is used as a hint to refer to what the vertex represents.

Stop.

Set the relationship, removing the old value.

Self API. Convert the object to a JSON string.

If the word is profanity, map it to something less offensive.

Return the relationship meta vertex.

Remove the relationships of the type.

Remove the relation of the type from the other vertex. This creates an inverse relationship.

Self API. Convert the object to a JSON string.

Evaluate the expression and return the result.

Unique id for the vertex. All vertices should define a unique identifier.

Print the object's data such as a sentence or paragraph.

Set if the vertex should be pinned to memory. Pinned vertices will not be forgotten.