Follow project on Twitter

2.3. The algebra of language

The logic of language can be written as algebra. Each of the 6 blocks of my challenge document shows the algebra of the described logic. As an example, let's consider the first algebraic equation of the first block:

“{proper noun 1} is {indefinite article + singular noun} of {proper noun 2}”
equals to
“{proper noun 2} has {indefinite article + singular noun} called {proper noun 1}”

If you like:
• “equals to” can be written as '=';
• The unknowns {proper noun 1} and {proper noun 2} can be written as 'pn1' and 'pn2';
• And a short notation for {indefinite article + singular noun} can be invented, as well as a language independent short notation for the words “is”, “of”, “has” and “called”.

But I leave the honor of the abbreviations and short notations to the one who describes my fundamental approach in a scientific paper.

In this case (of a conversion), both sides of the equation are interchangeable, like: x = x'. So, the left side of the equation can be converted into the right side – and vice versa – from one sentence to another sentence. Both sides (both sentences) are equal in natural meaning. But the algebra described in my challenge document, is not described in any scientific paper yet.

In order to make the system language independent:

• Logic / algebra itself is language independent. By embedding one set of logic / algebra / universal reasoning rules, the system will be (almost) language independent;
• During start-up, the system will read grammar configuration files, which will configure this universal logic for the corresponding language. One configuration file for each available language;
• On reading, the input sentence is converted to a language-independent knowledge structure, using the grammar rules of the corresponding language, as described in paragraph 4.1.1 Reading a Sentence of the design document;
• Then the universal reasoning rules are applied to that language-independent knowledge structure;
• On writing, the derived knowledge – the results of the reasoner – are written as readable sentences, by applying the grammar rules of the same language as the input sentence.