cosmetics: Fix spelling mistakes

Signed-off-by: Diego Biurrun <diego@biurrun.de>

1 files changed, 7 insertions, 7 deletions

diff --git a/doc/viterbi.txt b/doc/viterbi.txt
index 97825462cc..712fc4b150 100644
--- a/doc/viterbi.txt
+++ b/doc/viterbi.txt
@@ -1,7 +1,7 @@
-This is a quick description of the viterbi aka dynamic programing
-algorthm.
+This is a quick description of the Viterbi aka dynamic programming
+algorithm.
 
-Its reason for existence is that wikipedia has become very poor on
+Its reason for existence is that Wikipedia has become very poor on
 describing algorithms in a way that makes it useable for understanding
 them or anything else actually. It tends now to describe the very same
 algorithm under 50 different names and pages with few understandable
@@ -41,7 +41,7 @@ readable)
 Our goal is to find a path from left to right through it which
 minimizes the sum of the score of all edges.
 (and of course left/right is just a convention here it could be top down too)
-Similarly the minimum could be the maximum by just fliping the sign,
+Similarly the minimum could be the maximum by just flipping the sign,
 Example of a path with scores:
 
     O   O   O   O   O   O   O
@@ -53,7 +53,7 @@ Example of a path with scores:
     O   O   O   O   O   O-1-O---> (sum here is 24)
 
 
-The viterbi algorthm now solves this simply column by column
+The Viterbi algorithm now solves this simply column by column
 For the previous column each point has a best path and a associated
 score:
 
@@ -100,10 +100,10 @@ trivial given we know the previous column best paths and scores:
     O     0     4
 
 
-the viterbi algorthm continues exactly like this column for column until the
+the Viterbi algorithm continues exactly like this column for column until the
 end and then just picks the path with the best score (above that would be the
 one with score 3)
 
 
-Author: Michael niedermayer
+Author: Michael Niedermayer
 Copyright LGPL