Category:Enguage: Difference between revisions

Content added Content deleted
No edit summary
Line 1: Line 1:
{{language|Enguage}}
{{language|Enguage}}
Enguage is a speech understanding algorithm which supports the idea that speech is Turing complete, so respectfully requests a place on Rosetta Code.
Enguage is a speech understanding algorithm, implemented in plain Java, which supports the idea that speech is Turing complete.
It is informed by linguistic theory, in particular Pragmatism, Ordinary Language Philophy and Speech Act theory.
It is informed by linguistic theory, in particular
[https://en.wikipedia.org/wiki/Pragmatic_maxim Pragmatism],
⚫
These were developed in the latter half of the 20th Century: at the same time as the rise of traditional context-free programming languages.
[https://en.wikipedia.org/wiki/Ordinary_language_philosophy Ordinary Language Philosophy] and
[https://en.wikipedia.org/wiki/Speech_act Speech Act theory].
⚫
The latter two were developed in the second half of the 20th Century, that is, at the same time as the rise of traditional context-free programming languages.


While the examples here are given in English, it can be applied to any natural language.
While the examples here are given in English, it can be applied to any natural language.
While untested, it should work with Unicode characters so it could be used to implement [https://en.wikipedia.org/wiki/John_Searle John Searle] 's [https://en.wikipedia.org/wiki/Chinese_room Chinese Room].
While untested, it should work with Unicode characters so it could be used to implement [https://en.wikipedia.org/wiki/John_Searle John Searle]'s
[https://en.wikipedia.org/wiki/Chinese_room Chinese Room].
It is therefore the interpreter, and not the language, to which Enguage refers.
Enguage therefore the interpreter, and not the language, to which Enguage refers.
It ''can'' be used to process data, but it is not efficient in doing this.


It is largely unsuitable for interpreting writing, as this is not a discourse.
It ''can'' be used to process data, but it is not efficient in doing this;
and it is largely unsuitable for interpreting writing, as this is not a discourse.
==Background==
==Background==
"Enguage" is a portmanteau of the words Language and Engine - hence its unconventional spelling.
"Enguage" is a portmanteau of the words Language and Engine - hence its unconventional spelling.
It is being actively developed and has been since 2011.
It was developed in C between 2011 and 2013, and remains under actively developed and has been since 2011.
It won the British Computer Society's Machine Intelligence Competition in 2016.
It won the British Computer Society's Machine Intelligence Competition in 2016.


Line 70: Line 74:


===Gödel Numbering===
===Gödel Numbering===
Kurt Gödel devised a numbering scheme to represent mathematical equations so as to show that there are statements that can be made in a system which cannot be proved in that system, ultimately showing mathematics to be incomplete. This non-consecutive numbering system can be adapted to present a symbolic representation of linguistics.


===Speech Act Theory===
===Speech Act Theory===
[https://en.wikipedia.org/wiki/J._L._Austin J. L. Austin] used his William James' Lecture, at Harvard in 1955, to critique the traditional analysis of language towards truth statements.
[https://en.wikipedia.org/wiki/J._L._Austin J. L. Austin] used his William James' Lecture, at Harvard in 1955, to critique the traditional analysis of language towards truth statements.
He introduce the idea of performative statments which include:
He introduce the idea of performative statements which include:
what is uttered, locution;
what is uttered, locution;
what is meant by this, illocution: and,
what is meant by this, illocution: and,
Retrieved from "https://rosettacode.org/wiki/Category:Enguage"