10
0 SSSS 1 d s s 1 a " # PPPP 000 000 1 eee d e e dddd eeee d d SSS p p o o o o S pppp 0000 1 ) " " S p o o o o j e d d eeee dddd SSSS p 000 000 1 m 0 0 0 PPPP FFFFf F 1. P P t 1 i l P P r rr PPPP rr r P r n ttt F 1 eee e e eeee 0 eee r rr 0 nnnn t FFFF F 1 i i i i e e rr r eeee r I i i i n n t n n t 1 r P r P r F F 1 e r e 0 n n tt ] eeee r eeee 0 0 ♦START* Job m Reg #240 for CSD.JEANIE Bate 17-Apr-81 9:47:15 Monitor: Stanford SCORE, TOPS-20AN Monitor 4(3247 *START* File PS:<SPaOL>LPT-1431-0-..28, created: 17-Apr-81 9:47:14, printed: 17-Apr-81 9:47:18 0 0 Job parameters: Request created: l7-Apr-81 9:47:14 Page limlt:23 Forais:HCR«AL account: File parameters: Copy: 1 of 1 Spacing:SlsGLE File format: ASCll Print mode: ASCII /DELETE 0 m "

0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

0

SSSS 1 dss

1 a" #PPPP 000 000 1 eee d

e e ddddeeee d d

SSS p p o o o oS pppp 0000

1)" "S p o o o o j e d d

eeee ddddSSSS p 000 000 1

m 0

0 0PPPP FFFFfF

1.P P t 1i lP P r rrPPPP rr rP r

n ttt F 1 eeee eeeee

0 eee r rr 0nnnn t FFFFF

1iiii

e e rr reeee r

Iiii

n n tn n t

1rP rP r

FF

1e r e 0n n tt ]eeee r eeee

0 0

♦START* Job m Reg #240 for CSD.JEANIE Bate 17-Apr-81 9:47:15 Monitor: Stanford SCORE, TOPS-20AN Monitor 4(3247 *START*File PS:<SPaOL>LPT-1431-0-..28, created: 17-Apr-81 9:47:14, printed: 17-Apr-81 9:47:18 00Job parameters: Request created: l7-Apr-81 9:47:14 Page limlt:23 Forais:HCR«AL account:File parameters: Copy: 1 of 1 Spacing:SlsGLE File format: ASCll Print mode: ASCII /DELETE 0

m "

Page 2: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

M «-17-Apr-8I 08:51: OO-PST, 11813; GG0GOCOOGOC1Mail-from: ARPAHET site SOKEX-AIM rcvd at 17-Apr-81 G849-PSTDate: 17 Apr 1981 GB4B-PST" From: FeigenbaunM&SUMEX-AIHSubject: pis print these for meTo: csd. jeaniefiSCOßE

1 16 Apr LAMIIIer.VIMAD at HI- technology analysisil2 16 Apr LAMIIIer.VIMAD at HI- Technology Analysis '"

m\ ._._. ************************Mall-frost: ARPANET host HI-MULTICS rcvd at 16-Apr-81 1218-PSTDate: 16 April 1981 14:20 est" From: LAMIIIer.VIMAD at H_-NulticsSubject: technology analysisil

mTECHNOLOGY ANALYSIS

" Figure — indicates the general approach to the technologyanalysis the Honeywell Team will take. The analysis will beterms of the sources examined previously. The products of theTechnology Analysis will be state-of-the-art analyses andTechnology Forecasts for each technology area. Thestate-of-the-art analyses and Forecasts will contain tables andmatrices oriented toward the development of the Tradeoff Studiesand the Design Guidelines.

**■

" «.

0am.

The thrust of the Technology Analysis will be to provide theframework for supplying engineering solutions to design questionsfor knowledge-based systems. At present, there are no generalguidelines or procedures to follow for specifying, given anapplication domain, when to use a particular ArtificialIntelligence Technology, This must be remedied before thetradeoff studies can be performed or the design guidelines can bedeveloped.

"

K*H_-Hn__l*Ho_.*Hw_,*Hl_,*ae«*Bd_.*flg_.*He_,R*fi ~He ~Hp ~Hr_~He ~Hs -He -Bn "Ht *Hafly_.A*H ~Hn__/*Ha_~Hl_~Hyj*Hs_/k Hi_*Hs

*at »| ~Ho_"Hn_T~H *He_~Hc_~Hl__~*i

The tasks associated with performing the knowledge RepresentationTechnology Analysis are:

o Catalog representation programs

o Analyze and evaluate the state-of-the-art KnowledgeRepresentation Programs

o Forecast future trends of KnowledgeTechnology

♦ Representation

C*«-_~Ha_~Ht^Ha_-Hl_-„o_-Hg_~8i_*H^^^ t__.~Hi_~Ho_I_~Hn._.P~H, ~Br„.~Ho_~fc

There are many representation programs written especially for asingle application domain. These include programs dealing with aparticular domain as well as programs dealing at the reasoning

" i

*

*

*

*

Page 3: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

" about reasoning, or meta-knowledge, level. However, there is nota generally agreed upon method available for catalogingrepresentation programs or for generalizing over differentapplication domains. Providing a classification mechanism to dothis will be a product of this task.

-

" -To begin to generate a classification mechanism, a baselinecataloging device, due to Jewell, McDermott and Forgy (1977) willbe used. Newell et al's device describes representatiNewell et al's device describes representations interms of their:

0 o Data structures

o Operations<S

*

#

Page 4: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

*

"-"-

o Operation costsr Data structures are collections of structured objects usually

specified as words from an infinite language. Examples of datastructures are: "~

o Predicate calculus statements

"" o Semantic nets

o Production systems"

o Planner- like languages

"- o Frames

Operations are collections of processes, or functions, which 0" operate on these date structures. Newell et al's list ofoperation include:

"<" o Reading: How knowledge is extractedstructure

from dataa

"40o Writing: How the data held in a data structure can

modifiedbe

- o Inferring: How knowledge not explicitly held in a datastructure can be extracted

o Transferring: How is information to bepartition of the knowledge base to another

copied from one

o Focusing: Bow it is determined where or which operatoris to be applied next

o Encoding: How external symbol structures are mapped intointernal symbol structures- mappedo Decoding: How an internal symbol structure isinto external symbol structures

" associated withto

the space and time costso*fl..*Hp_*fle__.*Hr_ <k Ha_.'kHt.*Hi-*fio.*Hn_,C*H ~Ho_.~Hs_~Ht_*Hs areassociated with each of the operations. These can be useddetermine the computing resources a representation reguires.fNewell et al*s classification mechanism will be modified asneeded during this task. Modifications are possible because manyof the representation program packages have been tailored tospecific application domains. Hewell et al's categories do notreflect these changes in a way that can be used later on to makeestimates as to when particular kinds of representations should

"~be used. Nor does the cataloging, as it stands, show a taxonomyof representation programs. The product of this task will be a Im matrix along the lines of Figure 14*1*

m

+

*

*

*

#

Page 5: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

- M

m

Figure H+l.

m

The evaluation of the knowledge representation programs will bein terms of the use to which it is put; The strengths andweaknesses of these programs will be identified. Examples ofmeans to assess these programs are:

m

How easily different knowledge activities can be encodedinto the data structures*

♦ o How efficient search of the representation informationis.

m Computer resources required

Other means for evaluating them will be determined during thecourse of Source Examination and the cataloging task,product of this task will be a matrix comparing the strengths andweaknesses of the program as shown in Figure N+2 and:

" The

" a state-of-the-artTechnology.

analysis of the Knowledge Representation

m

Future trends in Knowledge Representation Technology will beanalyzed. The current state-of-the-art will be used as abaseline, and trends predicted on the basis of work presently inprogress or research directions at various labs. The prodThe product ofthis task will be a Technology Forecast which lists the futuree technology trends and assesses the likelihood of theiravailability in the 1990-2000 time frame.

0

0

"*

*

*

*

*

" DataK~H_R~H_P~H ~Hs S~H___~Ht_~Hr__~Hu_~Hc_~Ht_~Hu_~Hr_~He_~Hs R~H ~Be_~Ha_~Hd H~H ~Hr_~Hi_~Ht_~He I~H__~Hn_~Hf _~He_~Hr

_~He_.~Hn_~Hc_~Hi_~Hn_~Hg _~Ho, ~Ho, ~Ho m

T~H ~He_~Hc_~Hh_~Hn_~Ho_~Hl_~Ho_~Hg_~Hy_E~H ~Hv_~Ha_~Hl_~Hu_~Ha_~Ht_~Hi_~Hc_.~Hn

Efficient EfficientK~H_R~H_P~H ~Hs E~H ~Hn_~Hc_~Ho_~Hd_~Hi_~Hn_~Hg _S~H__~He_~Ha_~Hr_~Hc_~Hh

K~H ~Hn_~Ho_~Hw_~Hl_~He_~Hd_~Hg_~He_R~H__~He_~Hp_~Hr_~ee_~Hs_~He_~Hn_~Ht_~Ba._~Ht._~Hi_~Ho_~Hn_T~H ~He_~Hc_~Hh_~Hn_~Ho_~Hl_~Ho_~Hg__~Hy:~H___F~H ~Hu_~Ht_~Hu_~Hr_~He_T~H ~Hr_~He_~Hn_~Hd_~Hs_A~H__~Hn_~Ha_~Hl_~Hy_~Hs_~Hi_~Hs

Page 6: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

am>.

;

mm.

-«■"

("

2 — ************************Mail-from: ARPANET host HI-MULTICS rcvd at 16-Apr-81 1225-PSTDate: 16 April 1981 14:27 estFrom: LAMIIer.¥IMAD at BT-MulticsSubject: Technology Analysis

0

" The tasks associated with performing the Natural LanguageProcessing Technology Analysis are the following:

"~o Catalog Natural Language Processing Systems

o Examine multi-modal human/computer interface systemsm>

o Analyze and evaluate the state-of-the-art of SaturalLanguage Processing Technology

"o Forecast future trends in Natural Language Processing

Technology" C~H__~Ha_~Ht_~Ha_~Hl_~Ho_~B.g_?l~H__~Ha_~Ht_~Hu_~Hr_~Ha_~Hl_L~H__~Ha_~Hn_~Hg_~llu_~Ha_~liS~H_~ByZ~HsI~HtZ~HeI~HiiZ~Hs m

"natural Language Processing Systems run along a continuum fromsimple template matching systems like Raphael's SIR and Bohrow'sSTODEiT to complex sophisticated systems such as liinograd's

SHRDLO and Schrenk's SAM and PAH. Just as in the case ofKnowledge Representation Technology, there is no agreed to

mechanism available to categorize Natural Language Processing

Systems. Therefore, a product of this first task will be to

<*"

«■*develop such an engineering oriented solution.«►

A preliminary classification will be used to begin this task? ofcourse, it is open to change as the analysis proceeds. The

♦mechanism is as follows:

«**

o Grammer used {if applicable), for example:

Context free gr ameers"

♦Context sensitive

Transformational grammer♦

Systemic grammer■">

Case grammer

o Parser used, such as—►

Template matching

«"* Phrase structure

***

*

_-H "Ha -Ht *Hu -Hr_-Ha_-Hl_L-H_-Ha_-Hn_«Hg_-Hu_-Ha_-Hg_-He_P-H_>Br_-Ho_-Hc_"H e_-Hs_-Hs_-fll_-Hn_-Hg_T-H„-He_-Hc_-Hh_»Hn_-Ho_-HlHo_"lg_-Hy_A"H__ XHn_"Ha_-Hl_-Hy_-Hs_"Hi_-Hs

Page 7: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

<*>

Extended (phrase structure) grammer6 -Semantic gran?mere Graomerless."""""

*<m

4t

"ft

»

#

"*""

Page 8: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

-" Knowledge representation used

Boundry on the kinds of sentences it can understand(unquanified sentences, quanified)

e o Person or computer controller

Means of handling context (resolving pronomial reference)

Computer resources required

The product of this task will beInterfaces.

catalog of multi-modal

The second task is to examine multi-modal person-computerinterfaces that have been developed. Examining these willsuggest the means to incorporate Matural Language Processing intosuch systems. The opportunity will also be taken to examineissues associated with:

Display formatting

Presentation of information content

Procedures for error recovery's

" Alternative user entry techniques

Capabilities and limitations of persons"o Response time requirements

mSince the Natural Language Processing system will be embedded ina larger system and will have to be compatible with its humanfactors person-computer interaction requirements; these will♦serve as a means to evaluate the multi-modal interfaces.they can be used to develop design guidelines.

The products of this task will be a table as in Figure N*4 ofmulti-modal interfaces categorized by the means used to interactwith the system and general guidelines for person-computerinteraction interface design.

TouchP~H__~Ha_~Hn_~He_~Hl M~H__~Ho_~Hu_~Hs_~He V~H__~Ho_~Hi_~Hc_~He$00

Int —m

-♦

■■■—<_s

Figure $+4.

——■

_____\

-

'^0

*

*

«*

*

*

*

e*

Page 9: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

This task consists of evaluating Natural Language ProcessingSystems and inter-modal interfaces. The evaluation of theNatural Language Processing Systems will be at least in terms ofthe number of kinds of sentences the system can handle and thecomputing resources required. The final cataloging mechanismchosen will determine a final means of evaluation.

The evaluation of multi-modal interfaces will be in terms thehuman factors guidelines established during the examination ofmulti-modal interfaces. A matrix as in Figure N+s willmatrix as in Figure N+s will bedeveloped.

H~H_F~H I~H ~Hs_~Hs._~Hu_~fie_~Hs

MM Im

- Figure fc+s.

» where cells are filled in according to whether or not humanfactors guidelines have been satisfied.

" The product of task will be a state-of-the-artNatural Language Processing Technology.

analysis of the

♦ H~H ~aa_~Bt_~Hu_~Hr_~Ha_~Hl_L~H ~Ha_~Hn_~Hg._~Hu_~Ha_~Hg_~He_P~H__~Hr_~Bo_~Hc_~He_~Bs_~Hs_~Hi_~.en_~Hg._T~H ~He_~Hc_~Hh_~Hn_~Ho_~Hl_Ho_~Hg_~Hy_F~H__~Hu_~Ht_~llu_~Hr_~He_T~H ~Hr_~He_~Hn_~Hd_~Hs_l~H__~Hn_~Ha._~Hl_~Hy_~Hs_~ei_~Hs

The current state-of-the-art will serve as a baseline. Trendswill be predicted on the basis of work presently in progress orresearch directions of scientists in various labs. The productof this task will be a Technology Forecast containing a list offuture trends in natural Language Processing Technology and anestimate of the likelihood of their availability in the 1990-2000time frame.

m

"♦

m

m

"" *».

*

<*

<*

T~H ~He_~Hc_~Hh_~Hn_~Ho_~Hl_~Ho_~Hg_~Hy_E~H__~Hv_~!la_~^l_~Hu_~Ha_-f|t_~Hi_~Ho_~Hn

Page 10: 0 SSSS 1 000 000 d 0000 j 000 000 - Stanford Universityxw600tz5293/xw600... · 2015-09-21 · "aboutreasoning, or meta-knowledge, level. However, there is not a generally agreed upon

10