Fix lots of typos

1 files changed, 2 insertions, 2 deletions

diff --git a/crawl-ref/source/dgn-delve.cc b/crawl-ref/source/dgn-delve.cc
index 02c506d10b..3e80332ac1 100644
--- a/crawl-ref/source/dgn-delve.cc
+++ b/crawl-ref/source/dgn-delve.cc
@@ -25,7 +25,7 @@
  *
  * Algorithm description:
  * The algorithm operates on a rectangular grid. Each cell can be 'wall'
- * or 'floor'. A (non-border) cell has 8 neigbours - diagonals count.
+ * or 'floor'. A (non-border) cell has 8 neighbours - diagonals count.
  * There is also a cell store with two operations: store a given cell on
  * top, and pull a cell from the store. The cell to be pulled is selected
  * randomly from the store if N_cells_in_store < 125, and from the top
@@ -33,7 +33,7 @@
  * repetitions, so a given cell can be stored multiple times.
  *
  * The algorithm starts with most of the map filled with 'wall', with a
- * "seed" of some floor cells; their neigbouring wall cells are in store.
+ * "seed" of some floor cells; their neighbouring wall cells are in store.
  * The main loop in delveon() is repeated until the desired number of
  * floor cells is achieved, or there is nothing in store:
  *     1) Get a cell from the store;