diff --git a/src/errors.rs b/src/errors.rs
index 0d8a7f1..922e906 100644
--- a/src/errors.rs
+++ b/src/errors.rs
@@ -23,7 +23,8 @@ impl fmt::Display for ErrorPosition {
     }
 }
 
-/// The type of error that occured during file parsing
+
+/// The type of error that occurred during file parsing
 #[derive(Clone, Debug, PartialEq, Eq)]
 pub enum ParseErrorKind {
     /// An error happened during file/stream input/output
diff --git a/src/sequence.rs b/src/sequence.rs
index 6dc37af..0e33b7d 100644
--- a/src/sequence.rs
+++ b/src/sequence.rs
@@ -105,7 +105,7 @@ pub fn complement(n: u8) -> u8 {
 }
 
 /// Taking in a sequence string, return the canonical form of the sequence
-/// (e.g. the lexigraphically lowest of either the original sequence or its
+/// (e.g. the lexicographically lowest of either the original sequence or its
 /// reverse complement)
 pub fn canonical(seq: &[u8]) -> Cow<[u8]> {
     let mut buf: Vec<u8> = Vec::with_capacity(seq.len());
@@ -133,7 +133,7 @@ pub fn canonical(seq: &[u8]) -> Cow<[u8]> {
     }
 }
 
-/// Find the lexigraphically smallest substring of `seq` of length `length`
+/// Find the lexicographically smallest substring of `seq` of length `length`
 ///
 /// There's probably a faster algorithm for this somewhere...
 pub fn minimizer(seq: &[u8], length: usize) -> Cow<[u8]> {