diff --git a/src/libcore/str.rs b/src/libcore/str.rs
index 8f68ff8d4da..f1136fde5e2 100644
--- a/src/libcore/str.rs
+++ b/src/libcore/str.rs
@@ -566,7 +566,7 @@ pure fn to_upper(s: str/&) -> str {
 }
 
 #[doc = "
-Replace all occurances of one string with another
+Replace all occurrences of one string with another
 
 # Arguments
 
diff --git a/src/libstd/par.rs b/src/libstd/par.rs
index ffca5989857..e621fd78724 100644
--- a/src/libstd/par.rs
+++ b/src/libstd/par.rs
@@ -7,7 +7,7 @@ import future::future;
 export map, mapi, alli, any, mapi_factory;
 
 #[doc="The maximum number of tasks this module will spawn for a single
-operationg."]
+operation."]
 const max_tasks : uint = 32u;
 
 #[doc="The minimum number of elements each task will process."]
diff --git a/src/test/bench/graph500-bfs.rs b/src/test/bench/graph500-bfs.rs
index e51cb6c98b2..6c6466017ef 100644
--- a/src/test/bench/graph500-bfs.rs
+++ b/src/test/bench/graph500-bfs.rs
@@ -1,6 +1,6 @@
 /**
 
-An implementation of the Graph500 Bread First Search problem in Rust.
+An implementation of the Graph500 Breadth First Search problem in Rust.
 
 */