Fix typos and spelling

Author: SaschaWillems

en/00_Introduction.adoc

@@ -75,7 +75,7 @@ link:https://vulkan.gpuinfo.org/[Vulkan Hardware Database].
 * Experience with C{pp}
 ** Familiarity with RAII, initializer lists
 * A compiler with decent support of C{pp}20 features
-** Visual Studio 2017+, GCC 7+, Or Clang 5+
+** Visual Studio 2017+, GCC 7+, or Clang 5+
 * Some existing experience with realtime 3D computer graphics
 ** E.g., OpenGL or Direct3D
 

en/08_Loading_models.adoc

@@ -15,7 +15,7 @@ We _will_ load mesh data from an OBJ model in this chapter, but we'll focus more
 We will use the https://github.com/syoyo/tinyobjloader[tinyobjloader] library to load vertices and faces from an OBJ file.
 It's fast and it's easy to integrate because it's a single file library like stb_image.
 This was mentioned in the link:02_Development_environment.adoc[Development
-Enviornment] chapter and should be part of the dependencies for this portion
+Environment] chapter and should be part of the dependencies for this portion
 of the tutorial.
 
 == Sample mesh

en/courses/18_Ray_tracing/03_Ray_query_shadows.adoc

@@ -56,7 +56,7 @@ bool in_shadow(float3 P)
 Next, we will initialize a `RayQuery` object which will be used to perform the ray traversal. Note the choice of flags that we use to make it faster:
 
 - `RAY_FLAG_SKIP_PROCEDURAL_PRIMITIVES` since this is a simple scene with triangles only.
-- `RAY_FLAG_ACCEPT_FIRST_HIT_AND_END_SEARCH` to end the traversal as soon as the first opaque interesection is found, which is sufficient for shadow testing since we only need to know if anything blocks the light.
+- `RAY_FLAG_ACCEPT_FIRST_HIT_AND_END_SEARCH` to end the traversal as soon as the first opaque intersection is found, which is sufficient for shadow testing since we only need to know if anything blocks the light.
 
 [,slang]
 ----
@@ -76,7 +76,7 @@ Then we will start the ray tracing operation which combines our ray description,
     sq.Proceed();
 ----
 
-`Proceed()` advances the state of the `RayQuery` object to the next intersection "candidate" along the ray. Each call to `Proceed()` checks if there is another intesection to process. If so, it updates the query's internal state so that you may access information about the current candidate intersection. This allows you to implmement custom logic for handling intersections, such as skipping transparent surfaces (which we will revisit later in this lab) or stopping at the first opaque hit. It is typically called within a loop to iterate through all potential intersections, but for shadows we only need the first hit:
+`Proceed()` advances the state of the `RayQuery` object to the next intersection "candidate" along the ray. Each call to `Proceed()` checks if there is another intersection to process. If so, it updates the query's internal state so that you may access information about the current candidate intersection. This allows you to implement custom logic for handling intersections, such as skipping transparent surfaces (which we will revisit later in this lab) or stopping at the first opaque hit. It is typically called within a loop to iterate through all potential intersections, but for shadows we only need the first hit:
 
 [,slang]
 ----

en/courses/18_Ray_tracing/04_TLAS_animation.adoc

@@ -26,7 +26,7 @@ for (auto & instance : instances) {
 }
 ----
 
-Next, we need to prepare the geometry data for the TLAS build. This is similar to what we did when creating the TLAS, but now we will use the updated instance buffer. We also need to change the build `mode` to `eUpdate`, and define a source TLAS as well as a destination TLAS. This instructs the implementation to update the existing TLAS in-place instead of creating a new one. This is more efficient when only minor changes (like transforms) have occured:
+Next, we need to prepare the geometry data for the TLAS build. This is similar to what we did when creating the TLAS, but now we will use the updated instance buffer. We also need to change the build `mode` to `eUpdate`, and define a source TLAS as well as a destination TLAS. This instructs the implementation to update the existing TLAS in-place instead of creating a new one. This is more efficient when only minor changes (like transforms) have occurred:
 
 [,c{pp}]
 ----