Proceedings of the November 7-10, 1966, Fall Joint Computer Conference on XX - AFIPS '66 (Fall) 1966
DOI: 10.1145/1464291.1464329
|View full text |Cite
|
Sign up to set email alerts
|

An approach toward answering English questions from text

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

1967
1967
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…For him the fundamental notion is that of a "semantic network", defined essentially by the statement of relational triples of form aRb, where R is the name of a relation and a and b are the names of nodes in the network. Simmons work with this general formalism goes back to at least 1966 (Simmons et al, 1966) but, in its newer form with case formalism, it has been reported since 1970 (Simmons 1970b) (Simmons and Bruce 197 1) (Simmons and Slocum 1972). (Simmons 1973), and (Hendrix et al 1973) may reasonably be considered a further implementation of Simmons' methods.…”
Section: Sini Inonsmentioning
confidence: 99%
“…For him the fundamental notion is that of a "semantic network", defined essentially by the statement of relational triples of form aRb, where R is the name of a relation and a and b are the names of nodes in the network. Simmons work with this general formalism goes back to at least 1966 (Simmons et al, 1966) but, in its newer form with case formalism, it has been reported since 1970 (Simmons 1970b) (Simmons and Bruce 197 1) (Simmons and Slocum 1972). (Simmons 1973), and (Hendrix et al 1973) may reasonably be considered a further implementation of Simmons' methods.…”
Section: Sini Inonsmentioning
confidence: 99%
“…First, some sort of more formal notation is substituted for the actual English sentences in the base of stored knowledge. This notation may take many different forms, such as "descr;ption lists" ( Raphael, 1968), "kernels" ( Simmons, 1966), "concept-relationconcept triples" (Simmons et al, 1966)) "data nodes" ( Quillian, 1969 ) , "rings" ( Thompson, 1966)) "relational operators" ( Tharp, 1969), etc. Each of these forms is designated for efficient use in a particular system, but at heart they are all doing the same thing-providing a notation for simple assertions of the sort described in Section 1.5.…”
Section: Limited Logic Systemsmentioning
confidence: 99%
“…An even more common occurrence is when the two names are not synonyms but map onto the concept in different ways. For example, the words "buy" and "sell," to use Simmons' (1966) example, can be handled most easily if they refer to the same concept. «■ conceptual identity of "buying" and "sellinq" can he seen in the I following sentences: "He sold the girl two chairs.…”
Section: Concepts Are Not Quite Word-conceptsmentioning
confidence: 99%