Hypotheses

The hypotheses that I'm presently testing are

1) Representation Hypothesis

Letting P(X,Y) = ~P(Y,X)

A natural language sentence can be represented:

S → S₁ | S₁ S₂ | S₁ S₂ S₃ ...
S_i → P(A,A) | ~P(A,A)
A → P(A,A) | ~P(A,A) | N | _
N → n₁ | n₂ | n₃ ...
P → p₁ | p₂ | p₃ ...

2) Noun Order Hypothesis

We can view S as a sequence of trees. The leaf nodes of those trees, that are nouns, if viewed as a sequence, can be such that a noun can only be in that sequence if the previous noun from the natural language sentence exists previously in the sequence.

3) Hypothesis of Heuristic

It is heuristically possible to convert to and from this representation and natural language.


Optionally, for sentence structures resembling “X makes Y Z” and “X finds Y Z”, and should it help the heuristic, we can ammend the representation hypothesis:

S_i → P(A,A) | ~P(A,A) | P(A,P'(A,A)) | ~P(P'(A,A),A)
A → P(A,A) | ~P(A,A) | P(A,P'(A,A)) | ~P(P'(A,A),A) | N | _

Where P' can be determined from P.