Content deleted Content added
No edit summary |
No edit summary |
||
Line 2:
There is some overlap with the [[history of machine translation]], and the [[history of artificial intelligence]].
==
The history of machine translation dates back to the seventeenth century, when philosophers such as [[Leibniz]] and [[Descartes]] put forward proposals for codes which would relate words between languages. All of these proposals remained theoretical, and none resulted in the development of an actual machine.
Line 9:
In 1950, [[Alan Turing]] published his famous article "Computing Machinery and Intelligence"<ref>{{Harv|Turing|1950}}</ref> which proposed what is now called the [[Turing test]] as a criterion of intelligence. This criterion depends on the ability of a computer program to impersonate a human in a real-time written conversation with a human judge, sufficiently well that the judge is unable to distinguish reliably - on the basis of the conversational content alone - between the program and a real human.
In 1957, [[Noam Chomsky]]’s [[Syntactic Structures]] revolutionized Linguistics with '[[universal grammer]]', a rule based system of syntactic structures.<ref>{{cite web
| url = http://www.cs.bham.ac.uk/~pjh/sem1a5/pt1/pt1_history.html
| title = SEM1A5 - Part 1 - A brief history of NLP
| accessdate = 2010-06-25
}}</ref>
In 1969 [[Roger Schank]] introduced the [[conceptual dependency theory]] for natural language understanding.<ref>[[Roger Schank]], 1969, ''A conceptual dependency parser for natural language'' Proceedings of the 1969 conference on Computational linguistics, Sång-Säby, Sweden, pages 1-3</ref> This model, partially influenced by the work of [[Sydney Lamb]], was extensively used by Schank's students at [[Yale University]], such as Robert Wilensky, Wendy Lehnert, and [[Janet Kolodner]].
In 1970, William A. Woods introduced the [[augmented transition network]] (ATN) to represent natural language input.<ref>Woods, William A (1970). "Transition Network Grammars for Natural Language Analysis". Communications of the ACM 13 (10): 591–606 [http://www.eric.ed.gov/ERICWebPortal/custom/portlets/recordDetails/detailmini.jsp?_nfpb=true&_&ERICExtSearch_SearchValue_0=ED037733&ERICExtSearch_SearchType_0=no&accno=ED037733]</ref> Instead of ''[[phrase structure rules]]'' ATNs used an equivalent set of [[finite state automata]] that were called recursively. ATNs and their more general format called "generalized ATNs" continued to be used for a number of years.
==Implementations==
*The [[Georgetown-IBM experiment|Georgetown experiment]] in 1954 involved fully automatic translation of more than sixty Russian sentences into English. The authors claimed that within three or five years, machine translation would be a solved problem.<REF>Hutchins, J. (2005)</REF>
===60's===
*In the 60's, [[SHRDLU]], a natural language system working in restricted "[[blocks world]]s" with restricted vocabularies, worked extremely well, leading researchers to great optimism.
*LIFER/LADDER was a natural language interface to a database of information about US Navy ships.
An early success was [[Daniel Bobrow]]'s program [[STUDENT (computer program)|STUDENT]], which could solve high school algebra word problems.<ref>{{Harvnb|McCorduck|2004|p=286}}, {{Harvnb|Crevier|1993|pp=76−79}}, {{Harvnb|Russell|Norvig|2003|p=19}}</ref>▼
▲*An early success was [[Daniel Bobrow]]'s program [[STUDENT (computer program)|STUDENT]], which could solve high school algebra word problems.<ref>{{Harvnb|McCorduck|2004|p=286}}, {{Harvnb|Crevier|1993|pp=76−79}}, {{Harvnb|Russell|Norvig|2003|p=19}}</ref>
However, the real progress was much slower, and after the [[ALPAC|ALPAC report]] in 1966, which found that ten years long research had failed to fulfill the expectations, the funding was dramatically reduced.
Line 45 ⟶ 57:
==References==
{{Reflist}}
[[Category:History of artificial intelligence]]
| |||