| … | … | @@ -41,7 +41,7 @@ |
| 41 | 41 | ; |
| 42 | 42 | ; Consider, for example, a graphical editor - something where you can |
| 43 | 43 | ; drag-n-drop, hand-draw interacting bubble diagrams. Something easy |
| 44 | | ; to use - something a medical proffesional could get the hang of in |
| 44 | ; to use - something a medical professional could get the hang of in |
| 45 | 45 | ; half an hour - something where a disease model could be sketched out |
| 46 | 46 | ; with bubbles and lines and flow-charts. The goal of Atomese is that |
| 47 | 47 | ; it becomes easy -- really easy -- to convert such diagrams into |
| … | … | @@ -240,7 +240,7 @@ |
| 240 | 240 | ; network has been generated. |
| 241 | 241 | ; |
| 242 | 242 | ; ---- |
| 243 | | ; Network Gneration parameters. |
| 243 | ; Network Generation parameters. |
| 244 | 244 | |
| 245 | 245 | ; The key identifying the likelihood of creating a particular kind of |
| 246 | 246 | ; network node. This weighting controls the selection of the particular |
| … | … | @@ -386,7 +386,7 @@ |
| 386 | 386 | (format #t "Found a network of size ~D\n" (cog-arity (gar just-one))) |
| 387 | 387 | |
| 388 | 388 | ; --------------------------------------------------------------------- |
| 389 | | ; Assign initial suceptibility and infirmity values to individuals |
| 389 | ; Assign initial susceptibility and infirmity values to individuals |
| 390 | 390 | ; in the network. These will be randomly generated numbers. |
| 391 | 391 | |
| 392 | 392 | ; Each individual is linked back to the anchor node. Each individual |
| … | … | @@ -448,14 +448,14 @@ |
| 448 | 448 | ; Start applying state transition rules to the network. |
| 449 | 449 | ; |
| 450 | 450 | ; This will be done "by hand" for the first few rounds, just to show how |
| 451 | | ; it works. Several differnt styles will be shown. One is by directly |
| 451 | ; it works. Several different styles will be shown. One is by directly |
| 452 | 452 | ; running scheme code. A second, better way is by applying Atomese |
| 453 | | ; search-and-update rules directly to the atomspace contents. The |
| 453 | ; search-and-update rules directly to the AtomSpace contents. The |
| 454 | 454 | ; second way is ultimately simpler, and provides better automation, |
| 455 | 455 | ; but both ways are illustrated, for comparison. |
| 456 | 456 | |
| 457 | 457 | ; ------ But first, a handy utility: |
| 458 | | ; Execute some atomese. Assume that it returns a Setlink. |
| 458 | ; Execute some Atomese. Assume that it returns a SetLink. |
| 459 | 459 | ; Unwrap the SetLink, discard it, return the contents. |
| 460 | 460 | (define (exec-unwrap ATOMESE) |
| 461 | 461 | (define set-link (cog-execute! ATOMESE)) |
| … | … | @@ -469,7 +469,7 @@ |
| 469 | 469 | ; It requires, as input, the list of all relations created above. |
| 470 | 470 | ; As such, it is "static", depending on a static relationship list. |
| 471 | 471 | ; Later in the demo, we'll replace this loop by a search over the |
| 472 | | ; Atomspace. |
| 472 | ; AtomSpace. |
| 473 | 473 | (define (run-one-transmission-step) |
| 474 | 474 | |
| 475 | 475 | ; The transmission rule is directed, from second to first individual. |