Spell-check the demos

Author: linas

examples/foreign/README.md

@@ -32,7 +32,7 @@ in the example above do not need to be defined. A query on this dataset
 might be "find all expressions containing the word 'cherry'" or "find
 all expressions containing the symbol 'print'".  Careful, though: the
 goal here is not to just store "source code"; that would be silly. Every
-competent programmer has thier favorite tools for searching source code
+competent programmer has their favorite tools for searching source code
 for certain expressions. The point here is that vast oceans of trees can
 be stored, and very complex queries can be performed on the data.
 Explcitly, the data is represented as a graph, and the queries are

examples/haskell/README.md

@@ -21,7 +21,7 @@ export STACK_YAML=<ATOMSPACE_ROOT>/opencog/haskell/stack.yaml
 stack ghci --ghc-options -lhaskell-atomspace
 ```
 
-If when running an example you get an error: "...cannont open shared object
+If when running an example you get an error: "...cannot open shared object
 file: No such file or directory ...":
   - Remember to add: "/usr/local/lib/opencog" to your */etc/ld.so.conf* file.
   - Check if the file: */usr/local/lib/opencog/libhaskell-atomspace.so* exists.

examples/pattern-matcher/README.md

@@ -58,7 +58,7 @@ external stimuli into Atomese predicates.
 These "active" link types can be composed to describe processing
 pipelines and systems that are both accessible to reasoning and learning
 (because they encode "knowledge" of the pipeline) and at the same time,
-these processing pipleines can actually "do" whatever it is they are
+these processing pipelines can actually "do" whatever it is they are
 wired up to do.  One can imagine the Atoms as describing pipes or
 plumbing, and the values flowing through them as water flowing through
 the pipes. The AtomSpace holds the current configuration of the pipes;

examples/pattern-matcher/dot-product.scm

@@ -27,7 +27,7 @@
 (Evaluation (Predicate "domestic") (Concept "cat") (CountTruthValue 1 0 5))
 
 ; Define a Query that looks for the basis elements on the "dog" and
-; "cat" vectors. Once these are found, obtain the counts, and mutiply
+; "cat" vectors. Once these are found, obtain the counts, and multiply
 ; them together.
 (define qdot-math
 	(Query

examples/pattern-matcher/filter-value.scm

@@ -71,7 +71,7 @@
 					(Variable "$x"))
 				(Type 'LinkValue)))
 
-		; The sequence of Values to be filterd by above.
+		; The sequence of Values to be filtered by above.
 		(ValueOf (Node "some place") (Predicate "some key")))
 )
 
@@ -93,7 +93,7 @@
 					(Concept "parse")
 					(Glob "$x"))))
 
-		; The sequence of Values to be filterd by above.
+		; The sequence of Values to be filtered by above.
 		(ValueOf (Node "some place") (Predicate "some key")))
 )
 
@@ -115,7 +115,7 @@
 ; Values.) As there was more than one of these globs, a list of them
 ; were returned (so, a list of lists).
 ;
-; In the below, an addtitional transformation step will be applied:
+; In the below, an additional transformation step will be applied:
 ; a rewrite, to change the general form. For the demo, the rewrite
 ; will be simple: wrap the results with a label, a ConceptNode,
 ; and then stick them into a link, and OrderdLink for this demo.
@@ -132,7 +132,7 @@
 ; Now, for the weird part: it CANNOT be placed into the AtomSpace! It's
 ; an autogenerated intermediate wrapper, employed in certain special
 ; cases of pipeline processing of values. It will be printed in the demo
-; below; but you will note that none of the created Atoms are actualy
+; below; but you will note that none of the created Atoms are actually
 ; in the AtomSpace.  They remain floating, as Values. The demo after
 ; this will do something  with them.
 ;
@@ -157,7 +157,7 @@
 					(Glob "$x")))
 			(OrderedLink (Concept "bunch of edges") (Glob "$x")))
 
-		; The sequence of Values to be filterd by above.
+		; The sequence of Values to be filtered by above.
 		(ValueOf (Node "some place") (Predicate "some key")))
 )
 
@@ -201,7 +201,7 @@
 					(Glob "$x")))
 			(extract (Glob "$x")))           ; The complicate rewrite
 
-		; The sequence of Values to be filterd by above.
+		; The sequence of Values to be filtered by above.
 		(ValueOf (Node "some place") (Predicate "some key")))
 )
 
@@ -216,7 +216,7 @@
 ; A list of the keys on that edge:
 (cog-keys e)
 
-; The value attache to that key:
+; The value attached to that key:
 (cog-value e (Predicate "count"))
 
 ; Increment again.

examples/pattern-matcher/query.scm

@@ -20,7 +20,7 @@
 ; results, even while others are still being found.
 ;
 ; This example uses an AnchorNode to establish a "well-known location",
-; a QueryLink to attache them there, and a DeleteLink to detach results
+; a QueryLink to attach them there, and a DeleteLink to detach results
 ; from the AnchorNode. The  ParallelLink is used to run multiple threads,
 ; and SleepLink to slow it down enough to see what is happening.
 ;