Category:Enguage: Difference between revisions
no edit summary
Mjwheatman (talk | contribs) |
Mjwheatman (talk | contribs) No edit summary |
||
Line 1:
{{language|Enguage}}
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
[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].
▲
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]
[https://en.wikipedia.org/wiki/Chinese_room Chinese Room].
It
and it is largely unsuitable for interpreting writing, as this is not a discourse.
==Background==
"Enguage" is a portmanteau of the words Language and Engine - hence its unconventional spelling.
It
It won the British Computer Society's Machine Intelligence Competition in 2016.
Line 70 ⟶ 74:
===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===
[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
what is uttered, locution;
what is meant by this, illocution: and,
| |||