“A Computer Program for Understanding Natural Language”
E434313
“A Computer Program for Understanding Natural Language” is a landmark 1968 paper by Terry Winograd that presents an early natural language understanding system capable of interpreting and executing commands in a simulated blocks world.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Understanding Natural Language | 1 |
| “A Computer Program for Understanding Natural Language” canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4353365 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “A Computer Program for Understanding Natural Language” Context triple: [Semantic Information Processing, hasPart, “A Computer Program for Understanding Natural Language”]
-
A.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
B.
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence" is the seminal 1955 research proposal by John McCarthy and colleagues that launched the field of artificial intelligence by defining its goals and organizing the landmark 1956 Dartmouth conference.
-
C.
Computing Machinery and Intelligence
"Computing Machinery and Intelligence" is Alan Turing’s landmark 1950 paper that introduced the Turing Test and fundamentally shaped the philosophical and technical foundations of artificial intelligence.
-
D.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
E.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: “A Computer Program for Understanding Natural Language” Target entity description: “A Computer Program for Understanding Natural Language” is a landmark 1968 paper by Terry Winograd that presents an early natural language understanding system capable of interpreting and executing commands in a simulated blocks world.
-
A.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
B.
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
"A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence" is the seminal 1955 research proposal by John McCarthy and colleagues that launched the field of artificial intelligence by defining its goals and organizing the landmark 1956 Dartmouth conference.
-
C.
Computing Machinery and Intelligence
"Computing Machinery and Intelligence" is Alan Turing’s landmark 1950 paper that introduced the Turing Test and fundamentally shaped the philosophical and technical foundations of artificial intelligence.
-
D.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
E.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
natural language processing paper
ⓘ
scientific paper ⓘ |
| assumes |
restricted domain of discourse
ⓘ
restricted vocabulary ⓘ |
| author | Terry Winograd NERFINISHED ⓘ |
| contribution |
demonstration of computer understanding of restricted natural language
ⓘ
early example of dialogue with a computer about a world model ⓘ integration of syntax and semantics in language understanding ⓘ use of a restricted microworld to study language understanding ⓘ |
| demonstrates |
execution of commands in a simulated world
ⓘ
system answering questions about the world state ⓘ system maintaining an internal model of the world ⓘ |
| describes |
blocks world system
ⓘ
early natural language understanding system ⓘ |
| domain |
blocks arranged on a table
ⓘ
blocks of different colors ⓘ blocks of different shapes ⓘ |
| field |
artificial intelligence
ⓘ
computational linguistics ⓘ natural language processing ⓘ |
| focusesOn |
context-dependent interpretation
ⓘ
mapping language to actions ⓘ semantic interpretation ⓘ understanding natural language commands ⓘ |
| goal | show that computers can understand natural language in a limited domain ⓘ |
| historicalSignificance |
classic example of the blocks world approach
ⓘ
influential in the development of natural language understanding systems ⓘ landmark work in early AI ⓘ |
| influenced |
development of SHRDLU
ⓘ
early AI planning and reasoning systems ⓘ research on natural language interfaces ⓘ subsequent work in knowledge representation ⓘ |
| introduces | SHRDLU-like blocks world paradigm ⓘ |
| language | English ⓘ |
| publicationYear | 1968 ⓘ |
| topic |
handling of anaphora in commands
ⓘ
interaction between user and system via dialogue ⓘ parsing of English sentences ⓘ reference resolution in a microworld ⓘ representation of spatial relations ⓘ |
| uses |
procedural semantics
ⓘ
semantic representation of objects and relations ⓘ simulated blocks world ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: “A Computer Program for Understanding Natural Language” Description of subject: “A Computer Program for Understanding Natural Language” is a landmark 1968 paper by Terry Winograd that presents an early natural language understanding system capable of interpreting and executing commands in a simulated blocks world.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
Semantic Information Processing
→
hasPart
→
“A Computer Program for Understanding Natural Language”
ⓘ
this entity surface form:
Understanding Natural Language