Fix spelling mistake

CodeHubOrg · May 31, 2023 · 273efdf · 273efdf
1 parent a3f85aa
commit 273efdf
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 4 deletions.
diff --git a/03/README.md b/03/README.md
@@ -11,6 +11,6 @@ You can now generate text by visiting
 
 For example to generate text using an `order` of 4, an `iteration` of 1200 and a `starting text` of "Why do you think" in the style of Lewis Carroll visit
 
-http://localhost:8080/markov/caroll?o=4&i=1200&s=Why%20do%20you%20think
+http://localhost:8080/markov/carroll?o=4&i=1200&s=Why%20do%20you%20think
 
-Possible values for `{author}` are `caroll`, `forster` and `shakespeare`.
+Possible values for `{author}` are `carroll`, `forster` and `shakespeare`.
diff --git a/03/main.go b/03/main.go
@@ -134,7 +134,7 @@ func loadText(author string) (string, error) {
 	a := strings.ToLower(author)
 	var bookTitleTxt string
 	switch a {
-	case "caroll":
+	case "carroll":
 		bookTitleTxt = "alice_in_wonderland"
 	case "forster":
 		bookTitleTxt = "a_room_with_a_view"

diff --git a/README.md b/README.md
@@ -23,7 +23,7 @@ $ go run main.go
 ```
 
 ## Content
-By running the provided examples you'll be able to generate an arbitrary length of text in the style of various authors, including William Shakespeare, Lewis Caroll and E. M. Forster.
+By running the provided examples you'll be able to generate an arbitrary length of text in the style of various authors, including William Shakespeare, Lewis Carroll and E. M. Forster.
 
 ## Methodology
 We'll employ the idea of [Markov chains](https://en.wikipedia.org/wiki/Markov_chain) to analyse a sample text, based on which we'll produce new content. By running the algorithm on the aforementioned authors' books, now in the public domain, we can recognise pattern probabilities unique to their individual writing style and, as such, the generated text will follow the same stylistic probabilities.