diff -r c7ee2a2a3cff -r d4d1f6ca5c23 NEWS
--- a/NEWS	Tue May 09 11:25:34 2006 +0000
+++ b/NEWS	Tue May 09 14:28:02 2006 +0000
@@ -1,4 +1,4 @@
-2005-02-03  Version 0.5 Released
+2006-02-03  Version 0.5 Released
 	* New features:
 	  - Bfs/Dfs/Dijkstra
 	    + query functions for the next node/edge to be processed
@@ -16,7 +16,7 @@
 	  - Graph maps:
 	    + template assign operator
 	    + specialized iterable bool map
-	    + potencial difference map
+	    + potential difference map
 	    + NodeMatrixMap -- Matrix over the nodes
 	  - Maps:
 	    + IterableIntMap
@@ -46,7 +46,7 @@
 	  - "label" instead of "id" inside the LGF files
 	  - UndirGraph -> UGraph, UndirEdge* -> UEdge*
 	  - BipartiteGraph -> BpGraph, Lower/UpperNode* -> A/BNode*
-	* Buxfixes in
+	* Bugfixes in
 	  - DFS
 	  - Preflow
 	  - x86_64 connected bugfixes (lemon_reader.h)
@@ -55,7 +55,7 @@
 	  - graph_orientation.cc: A thoroughly documented demo application
 	  - runningTimeTest(): a tool to measure running times more precisely
 	  - Demo for topology
-	  - counter.h: a tool to measure the number of streps of algorithms
+	  - counter.h: a tool to measure the number of steps of algorithms
 	  - Some useful scripts: check-compiler, check-integrity
 	* Other changes:
 	  - Demos and benchmarks are not built by default now. They can be