text:
Talk:Viterbi algorithm

Extensions: undo weight?
The extensions are more like domain specific implementations, with only two methods suggested. Since many machine learning related grad programs require students to hack together Viterbi program for a sample problem, the selection of just a few papers doesn't seem justfied. Furthermore, judging from the number of citations, these are not seminal papers on machine learning. Disclaimer: I am not an author or any Viterbi paper, I declare no competing interests. — Preceding unsigned comment added by 24.5.84.124 (talk) 05:11, 29 December 2012 (UTC)

Trellis Diagram
The Trellis Diagram doesn't make sense to me, as there are multiple ways of reaching the second and third columns of states. Thus, each of the different pathways to reaching those states would have a different possibility, meaning that there should be more than one probability (as shown in the current diagram) associated with the second and third columns of states.

For example, for the second column of states, the following paths are possible to get to the 'Sunny' state:

Rain -> Sunny = 0.06 * 0.3 * 0.3 = 0.0054

Sunny -> Sunny = 0.24 * 0.6 * 0.3 = 0.0432

But only the last value is shown in the article's diagram. Do I misunderstand the Trellis diagram or is it missing a lot of the values for possible paths that a person requires before knowing which total path would have the best probability? If I'm not mistaken then either the diagram requires more details, or the problem requires multiple diagrams to fully show all possibilities. 146.232.75.208 (talk) 13:11, 19 November 2010 (UTC)
 * Well... or the probabilities shown on the nodes/states that aren't bold should not be displayed. 146.232.75.208 (talk) 13:17, 19 November 2010 (UTC)

The result of the Java code is not what it is described in the article
I executed the code, and I get: 0.033612005 Sunny,Rainy,Rainy,Rainy 0.009408001 Why 4 days and not 3 ? The numbers are also different.

Worked through by hand
I worked the example shown through by hand to help me understand how the algorithm works. I also did a brute force evaluation of the forward probability to verify everything was working correctly. Perhaps the notes maybe of use to someone:

http://sgenomics.org/mediawiki/index.php/HMM_Code

78.33.152.88 (talk) 12:34, 31 May 2009 (UTC)

Mathematical description
This page should have a description of the algorithm using mathematical formulas, as well. Already I have found two different descriptions of Viterbi and would like Wikipedia to clear things out.

Also Python may be a nice language, but using variable names like "p" or "v_prob" doesn't really explain the algorithm!
 * Strongly agree! I entered this page to find you have stated what I wanted to say.--Puekai 09:29, 6 March 2007 (UTC)

Yes I can describe the algorithm in simplified terms
I'm haveing a hard time to figure out where to put the description. There is nothing here that is not correct but it is a little confusing because of the usage of "hidden" and "events" without explaining. The algorithm itself is quite simple but I have a little problem with how it is described. I don't want to exorcise a lot of basically correct text, only to clarify in a more simple manner. I was thinking of adding a section just under the table of contents as an introduction, but being a newbie, I would need some lessons on how to do this.

I can also describe Trellis modulation. --User:jlpayton 9-sept-2005

.
Can someone show the algorithm here? — Kieff | Talk 07:33, Oct 15, 2004 (UTC)

 * I'll post an example illustrating the forward algorithm and the Viterbi algorithm (those are really the same algorithm). --MarkSweep 21:33, 15 Oct 2004 (UTC)

Algorithm Please
Python maybe a formally defined language but it isn't a clear language. This page should clearly provide an example of the trellis, dynamic programming, the recursion, the loop invariant. Now this dynamically typed tripe. contributed by 24.69.52.124 a.k.a. S01060060676712c2.gv.shawcable.net

 * On the contrary, Python is a very clear and concise language. But let's not get into a holy war about programming language preferences. You can cut and past the Python code and run it directly. That should give you a good idea of what's going on. Thank you for your suggestion! When you feel an article needs improvement, please feel free to make whatever changes you feel are needed. Wikipedia is a wiki, so anyone can edit almost any article by simply following the  link at the top. You don't even need to log in! (Although there are some reasons why you might like to…) The Wikipedia community encourages you to be bold. Don't worry too much about making honest mistakes—they're likely to be found and corrected quickly. If you're not sure how editing works, check out how to edit a page, or use the sandbox to try out your editing skills.  New contributors are always welcome. --MarkSweep 19:15, 21 Apr 2005 (UTC)

 * Sorry, I must admit that I agree with the original poster. I know the Viterbi algorithm, but was completely lost at the example given and then code. My suggestion would be: Drop the "rainy" and "sunny" story (it's utterly confusing), concentrate on some easy system instead (say, something with a transfer function of 1 + 0.5z^-1), and show a graphical description of the trellis and survivor paths. An encyclopedia shouldn't require people to cut-and-paste code to understand what's going on. 80.202.213.120

 * Is this a joke? I found the rainy and sunny story to be very easy to follow and a great example. Although the page probably could do with a proper mathematical definition to complement the easy explanation I found this to be very refreshing compared to other comp.sci./math articles around here. —Preceding unsigned comment added by 84.166.155.142 (talk) 21:22, 23 November 2007 (UTC)

 * +1 agree completely -- easy to follow and a great example. - Francis Tyers · 08:47, 6 October 2008 (UTC)

 * It is definitely not a joke. -Sesse (talk) 02:57, 29 January 2008 (UTC)

 * I agree the code isn't as clear as equations would be. I've added a small section with the recurrence relations.  Hopefully someone can expand it further. 128.237.249.50 (talk) 22:23, 2 May 2010 (UTC)

Does the python code have a missing line? It looks like there's a hanging "print" with no output in the print_dptable function. I personally found the python code quite helpful.

Rlrogers (talk) 22:47, 12 October 2011 (UTC)

Trellis modulation and the Viterbi algorithm
What exactly is the relation between Trellis modulation and the Viterbi algorithm ? --DavidCary 30 June 2005 19:32 (UTC)
 * Can't totally remember clearly but you should investigate Factor Graphs and see how the viterbi can be done with a factor graph --ReptileLawyer 18:13, 24 April 2006 (UTC)

Complexity?
Anyone know what the complexity of Viterbi is? I skimmed over it and it looks like it's O(s*n^2), where s is the size of the sequence it's given, and n is the number of possible states. Any thoughts? --aciel 20:41, 22 November 2005 (UTC)

 * That's correct. Depending on the data structures used to represent the underlying HMM, the Viterbi/Forward algorithm can be made to run in $$O(s\,n\,d)$$ time, where s is the length of the sequence, n is the number of hidden states, and d is the average out-degree of each state. This is because you only need to explore pairs of states that are actually connected by an edge. In a fully connected HMM, the running time is $$\Theta(s\,n^2)$$. --MarkSweep (call me collect) 22:11, 23 November 2005 (UTC)

Is the python correct?
No, the algorithm is not correct.

The computation of the probability of the output(x) given the optimal Viterbi path (pi), P(x|pi) algorithm consists of P(x|pi) = 1 starting probability * n emission probabilities * (n-1) transition probabilities

The displayed algorithm computes P(x|pi) = 1 starting probability * n emission probabilities * n transition probabilities.

There is an obvious off by 1 error.

—Preceding unsigned comment added by 199.94.29.210 (talk) 20:00, 8 May 2009 (UTC)

The python contains the line p = ep[state][output] * tp[state][next_state]

which in my understanding should be p = ep[next_state][output] * tp[state][next_state]

I assume the first state returned by the example is the initial state and the second state is the state that matches the first observation

The example returns ['Sunny', 'Rainy', 'Rainy', 'Rainy'] and after modification it returns ['Sunny', 'Sunny', 'Rainy', 'Rainy']

which would seam better given the example (observation 1 = walk)

Am I mistaken? if so a little help on the 4 returned states is welcome.

 * The code is correct as is. It's written the way it is to simplify the main loop and to allow an empty sequence of observations. For example, here's what happens when you run the code on an empty observation sequence:

>>> forward_viterbi([], ['q','r'], {'q':0.8, 'r':0.2}, {}, {}) (1.0, ['q'], 0.80000000000000004) >>>

 * This return value is the triple, which indicates the following: The probability of the observation sequence conditional on its length is 1.0 (that's obviously correct, since there is exactly one sequence with length zero); the Viterbi path consists of a single edge, leading from the (unnamed) start state to the state 'q'; and the probability of the Viterbi path is 0.8. The Viterbi path as returned by this code contains one more state, namely the state that is reached after leaving the state corresponding to the last observation (in this case, the state reached from the start state with probability 0.8). That's because emissions are associated with outgoing edges, rather than incoming edges (you may have seen a presentation of this algorithm that assumes the latter). Both versions of HMMs exist, in addition to a third one where emissions are properly associated with edges, so there are at least three common variants of the forward algorithm and the Viterbi algorithm. --MarkSweep (call me collect) 17:23, 15 December 2005 (UTC)

 * I (a different user) still don't understand. I haven't tested the change on the Python, but on my haskell version, both ways seem to work for the no-observation case. --196.210.100.237 (talk) 20:27, 11 February 2008 (UTC)

 * Running the algorithm by hand seems to indicate that the proposed correction to the algorithm is correct....I don't think this algorithm is correct.--151.201.108.130 (talk) 18:40, 6 May 2008 (UTC)

 * Really? I've never seen emissions associated with edges at all, only with nodes. That is certainly the case in the Hidden Markov model page here and in, e.g. the Rabiner reference used on that page, or in the Viterbi paper itself. If the Viterbi path is the path of states corresponding to the sequence of emissions, then there should be one state for each emission, not an extra state at the end.24.91.117.221 (talk) 14:32, 7 July 2008 (UTC)

 * The algorithm is incorrect indeed for another interpretation of what we call 'Viterbi path', following its direct definition as 'most likely explanation for an observation'. If we don't care about 'post-observation' state, then it must end in a state, for which we get last observation. The empty example result should be (1.0, [], 1.0) then. In that case the Viterbi path (without 'post-observation' state) cannot be obtained by current algorithm implementation by cutting last state (as soon we may loose Viterbi pathes to the penultimate states)! 85.141.70.130 (talk) 10:19, 4 April 2010 (UTC)

It seems that the correction above has been incorporated into the main page, but the output after modification ['Sunny', 'Sunny', 'Rainy', 'Rainy'] has not. It seems that either version of the algorithm should work. In the original version (using emission probability of the source state) ['Sunny', 'Sunny'] would be the first 2 states in the Viterbi path for the sunny state after one iteration of the "for output in obs" loop. The first three states of the vp for the rainy state would be ['Sunny', 'Rainy', 'Rainy'] after iteration 2, as the greater correlation between shopping and rain, combined with the higher transition probability of rain to rain vs. sun to sun would move this triple ahead of ['Sunny', 'Sunny', 'Sunny'] (note only the first two observations are known). ['Sunny', 'Rainy', 'Rainy', 'Rainy'] should be the correct output. In the second case (emission probability of the next state is used), the first iteration's Viterbi path for the sunny state would be ['Sunny', 'Sunny']. The second iteration's vp for sunny would then be ['Sunny', 'Sunny', 'Sunny'], and the final vp would be ['Sunny', 'Sunny', 'Rainy', 'Rainy']. However, I am not sure why it is necessary to keep these extra start or end states, as it seems that the length of the hidden state sequence should be the same as that of the observation sequence. Perhaps by using the revised (second) algorithm, we could obtain ['Sunny', 'Rainy', 'Rainy']. If we initialize prob to 1, v_path to [] and v_prob to 1 in T; and, if we are on the first "output" in the obs array, ignore trans_p in the p computation, it seems that we should obtain the correct three states. (update) Correction to above: it seems that: 1. the above suggestion to ignore tran_p in the case of the first observation works only in the case where emit_p is for the next_state. 2. The T array should be initialized to (start_probability, [], start_probability), it seems, so that the initial probabilities are a factor. 3. algorithm would be basically:

//T initialized to (start_prob, [], start_prob) for rainy and //sunny above count = 0 for output in obs: U = {} for nextstate in states: total = 0 argmax = none valmax = 0 if (count==0) (prob, v_path, v_prob) = T[next_state] p = emit_p[next_state][output] prob*=p v_prob*=p argmax = v_path + next_state valmax = v_prob else for source_state in states: . . .      //note that //p=emit_p[next_state][output]*trans_p[source_state][next_state] }         U[next_state]=(total, argmax, valmax) T=U count++ //apply sum/max to final states as before below.

4. Note that a similar modification could occur if emit_p is calculated for the source_state, but in this case the special condition would be when the count is at size(obs)-1 (ie the last observation). 76.241.101.61 (talk) 18:42, 27 September 2008 (UTC) (75.10.146.25 (talk) 04:28, 28 August 2008 (UTC))

 * I've replaced the code with a more correct and much simpler implementation. There's no forward algorithm as I felt it overcomplicated the code and also there's now a separate page for that algorithm. 128.237.249.50 (talk) 20:32, 2 May 2010 (UTC)

SOVA
I intend to add a section on soft output version of the VA....give me some time and let the link stay!!!

Pizzadeliveryboy 02:47, 19 January 2006 (UTC)

Algorithm seems wrong
I tried to apply the forward algorithm on the example given in the article, but I do not find the same result. Briefly, here is the forward algo I applied (from rabiner paper): Let say $$\lambda$$ an HMM system with $$A$$ the transitional matrix, $$B$$ the emission matrix, $$O = O_1 O_2 ... O_T$$ an observation sequence and $$\alpha_t(i)$$ is the porbability of observing $$O_1 O_2 ... O_t$$ and having $$S_i$$ as a state $$q$$ for the HMM at time $$t$$ so we have:

$$\alpha_t(i) = P(O_1, O_2 ..., O_t, q_t = S_i|\lambda)$$

The algo is like:

1- Initialization:

 * $$\alpha_1(i) = \pi_ib_{O_1 i} \quad \forall i \quad 1 < i <= N$$

with $$\pi_i$$ the start probability of state i

2- Deduction:

 * $$ \alpha_{t+1}(j) = \Big[\sum_{i=1}^N \alpha_i(t)a_{ij}\Big]b_{O_{t+1} j} \quad \forall j \quad 1 < j <= N $$

3-Terminaison

 * $$P(O|\lambda)=max(\alpha_T(i)) \quad \forall i \quad 1 < i <= N $$

Applying this algo with this code in python:

I got 0.02904 as a proba for the observation  given in the example. So which algo is wrong? I can give you the step of calculation, they are quite simple for such a small example.JeDi 05:14, 27 July 2006 (UTC)

 * Your algorithm failed to select the survivor path for each new symbol. I suggest using

 * Using this modified code suggests that the Viterbi path is Sunny, Rainy, Rainy, with probability 0.01344. This is the same value I get when doing all of the computations by hand (following Viterbi's paper, not your math or the article here). It corresponds to the product 0.4*0.6*0.4*0.4*0.7*0.5. This is the product of the probabilities of beginning in Sunny, emitting walk, transitioning to Rainy, emitting shop, transitioning to Rainy, finally emitting clean. If this is correct, the article will need to be changed. (Though your algorithm is misleading in that it prints, on each step, the currently most likely state, which will not necessarily end up on the final survivor path.)24.91.117.221 (talk) 14:46, 7 July 2008 (UTC)

A concrete example is partially wrong
From the transition matrix one can observe initial state probabilities, namely for given transition matrix probability of rainy day is 4/7, while probability of sunny day is 3/7. It appears that values in the example are rounded. 08:20, 28 December 2005 (UTC)

logs, comments
I realize it would make the code more complicated, but the implementation might be misleading because you really want to use logs of the probabilities to avoid underflows. I think the names of variables could be improved.

I think the output should have the same number of states as the number of observations. The observations are usually associated with states, not transitions between states.

 * The code (as is), works fine for the given example. However, for anything but trivial examples it is likely to fail. By using logs, this can be avoided (just a hint really).

Markov vs. probabilities
How does the Markov assumption of non-dependence on history exist together with the state transition probabilities being essential for the algorithm? Can that aspect be made clearer? 130.126.180.235 04:01, 30 May 2007 (UTC)BillBusen

The Markov assumption simply means non-dependence on history BEYOND one state back, so state transition probabilities which encompass a one-state history are permissible. I hope that clears up any confusion. --Tekhnofiend (talk) 17:43, 27 April 2008 (UTC)

concrete example, trellis diagrams
I'm somewhat disappointed by the section called "concrete example".

Sorely missing from this article are pictures of trellis diagrams, and an in-depth comparison to the space/time performance of the forward algorithm, and in particular to the forward-backward algorithm. It's critical (I think) to note that the Viterbi algo drops many of the links that the other algorithms keep, in exchange for an O(N) run time (as opposed to O(N^2) or whatever), and only a minor loss of entropy.

Certainly, I was utterly unable to understand Viterbi, until I saw it layed out in comparison to the other algos, at which point, things clicked together. linas (talk) 21:06, 10 June 2008 (UTC)

numerical example
I thought this might be useful. Using the data given in the article, here is a suggested numerical example of the algorithm. I'm rather new to the algorithm, so I'm posting it here to get comments before it goes in the main article. It is possible that I have misunderstood the algorithm and that this is incorrect. It is also possible that the algorithm as now used and as described in the article is different than that of the Viterbi paper on error bounds for convolutional codes.

What is the most probable path (and its probability) corresponding to the sequence of observations ? We first find the state most likely to have emitted walk, taking into account the probability of the system being in that state at all. In this case, the Rainy state is initially occupied with probability 0.6 and Rainy emits  with probability 0.1, so the probability of the actual sequence beginning with Rainy is 0.6*0.1 = 0.06. Similarly, the probability of the sequence beginning with Sunny is 0.4*0.6 = 0.24, because there is a probability of 0.4 of beginning in Sunny and Sunny emits  with probability 0.6. As there is only one path ending in Sunny and one path ending in Rainy, each becomes the survivor path (one state long) of this first step.

So it is expected the system is in the state Rainy with probability 0.06. For each state that can follow Rainy, what is the probability of that state emitting the next observation in the sequence: ? It is the probability that the system was in Rainy at all, 0.06, times the probability of Rainy transitioning to Rainy, 0.7, times the probability of Rainy emitting, 0.4. The probability that the first two states in the sequence are Rainy and Rainy is 0.06*0.7*0.4 = 0.0168. In the same way, we find the probability of the first two states being Sunny then Rainy is 0.0384. These are the only two paths of two states that can end in Rainy. Only the more likely one becomes the survivor path to be used in the next step. In this case, it the path of Sunny then Rainy. Similarly, we look at the two paths that end in Sunny, one beginning with Rainy and one with Sunny. Multiplying the appropriate probabilities shows that Sunny then Sunny is the most likely path that ends with Sunny, with probability 0.0432.

Specifically, the calculations are Rainy->Rainy: 0.06*0.7*0.4 = 0.0168 Sunny->Rainy: 0.24*0.4*0.4 = 0.0384 "survivor" Rainy->Sunny: 0.06*0.3*0.3 = 0.0054 Sunny->Sunny: 0.24*0.6*0.3 = 0.0432 "survivor"

That step is repeated on the two survivor paths: Sunny then Rainy and Sunny then Sunny. The four new calculations are Sunny->Rainy->Rainy: 0.384*0.4*0.6 = 0.01344 Sunny->Sunny->Rainy: 0.0432*0.4*0.5 = 0.00864 Sunny->Rainy->Sunny: 0.384*0.4*0.6 = 0.001152 Sunny->Sunny->Sunny: 0.0432*0.6*0.1 = 0.002592

Of these, the most probable path that would emit the specified observations is Sunny, Rainy, Rainy, with probability 0.01344. —Preceding unsigned comment added by 24.91.117.221 (talk) 15:13, 7 July 2008 (UTC)

Simplified Algorithm
Hi, I understand python, but I feel pseudo code is more applicable. Something which shows the idea, not the physical implementation is more useful in a pedagogical sense. I just read the article, and I suggest (hope someone can improve this basic pseudocode)

Optimize this for the layman
I think the above proposal about pseudocode is on the wrong track: Remove the code altogether, and replace it with a description, in English (not a programming language or pseudocode), of the thinking Alice has to do to figure out the weather where Bob is. Most people have never taken a programming class, or even a logic class; we should be putting this in terms that anybody can understand.--Aervanath (talk) 04:54, 2 February 2009 (UTC)

A possibly helpful version of the Viterbi algorithm in Java (placed here to avoid poluting the main article with tons of code)
After a fair amount of effort I produced this Java version of the Viterbi algorithm based on the version shown in this article. I've attempted to rename the variables so they will be easy for the novice to understand. I've tested it and it appears to work, but if any bugs are discovered it would be great to have them noted. As pointed out by another user, the state path produced is one state too long; the final state is bogus. I've elected to leave it intact here, but this issue can be resolved by removing the last state just before returning (however the state must be used during computations or invalid results are obtained). Note that the SparseMatrix class is not included, but it can be trivially replaced with a two-dimensional array of doubles. Using the SparseMatrix implementation decreases memory usage in one of my real world "part of speech" tests by a factor of 75.

protected class StatePathOdds { public double m_odds; public ArrayList m_path; public double m_pathOdds; //       public StatePathOdds (                double              odds,                ArrayList  path,                double              pathOdds) { m_odds = odds; m_path = new ArrayList (path); m_pathOdds = pathOdds; }// end StatePathOdds //       public StatePathOdds (                StatePathOdds       statePathOdds) { this (statePathOdds.m_odds, statePathOdds.m_path, statePathOdds.m_pathOdds); }// end StatePathOdds }// end class StatePathOdds

/** Determine the most likely hidden model states for the list of outputs passed in using the Viterbi algorithm. @param outputs An array of Strings that should be analyzed to find the best path of states. @param states The different states (represented as int ids that can be mapped to Strings externally). @param initialStateOdds The probability of each state occurring. @param transitionOdds Probability of transitioning from one state to another (should be states.length    by states.length in size). @param stateToOutputOdds Probability of the state machine generating a particular output when in a certain state (should be states.length by outputs.length in size). @param outputToIdNumberMap A map from output Strings to id numbers used to reference them. The mapping should match that used to create the stateToOutputOdds matrix. @return An ArrayList of Integers that indicates the state path for each output in the outputs array. The Integers indicate an index in the states array for each output in the outputs array. */   public ArrayList findBestStatePathViaViterbi (            String[]            outputs,            String[]            states,            double[]            initialStateOdds,            double[][]          transitionOdds,            SparseMatrix stateToOutputOdds,            HashMap outputToIdNumberMap) { StatePathOdds[] statePathOdds = new StatePathOdds[states.length]; for (int stateIndex = 0; stateIndex < states.length; stateIndex++) { statePathOdds[stateIndex] = new StatePathOdds (initialStateOdds[stateIndex],                   new ArrayList (Arrays.asList (new Integer [] { stateIndex })), initialStateOdds[stateIndex]); }//endfor for (String output : outputs) { StatePathOdds[] nextStatePathOdds = new StatePathOdds[states.length]; for (int nextStateIndex = 0; nextStateIndex < states.length; nextStateIndex++) { double totalOutputOdds = 0; ArrayList pathOfBestOdds = new ArrayList ; double bestPathOdds = 0; for (int stateIndex = 0; stateIndex < states.length; stateIndex++) { StatePathOdds currentStatePathOdds = new StatePathOdds (statePathOdds[stateIndex]); int outputId = outputToIdNumberMap.get (output); double outputOdds = stateToOutputOdds.get (stateIndex, outputId) * transitionOdds[stateIndex][nextStateIndex]; currentStatePathOdds.m_odds *= outputOdds; currentStatePathOdds.m_pathOdds *= outputOdds; totalOutputOdds += currentStatePathOdds.m_odds; if (currentStatePathOdds.m_pathOdds > bestPathOdds) { pathOfBestOdds = new ArrayList (currentStatePathOdds.m_path); pathOfBestOdds.add (nextStateIndex); bestPathOdds = currentStatePathOdds.m_pathOdds; }//endif }//endfor nextStatePathOdds[nextStateIndex] = new StatePathOdds (totalOutputOdds, pathOfBestOdds, bestPathOdds); }//endfor statePathOdds = nextStatePathOdds; }//endfor int indexOfBestPath = 0; for (int statePathOddsIndex = 0; statePathOddsIndex < statePathOdds.length; statePathOddsIndex++) { if (statePathOdds[statePathOddsIndex].m_pathOdds > statePathOdds[indexOfBestPath].m_pathOdds) { indexOfBestPath = statePathOddsIndex; }//endif }//endfor return statePathOdds[indexOfBestPath].m_path; }// end findBestStatePathViaViterbi

Twikir (talk) 14:01, 14 June 2009 (UTC)

Viterbi vs the Forward Algorithm
I feel compelled to point out (or rather, shout) that the Viterbi algorithm and the Forward algorithm are NOT the same algorithms (Why does Forward algorithm point here??). They do not have the same calculations, and they absolutely do not produce the same results. They are related algorithms, but not the same. In a nutshell, Viterbi computes the most likely sequence of states, whereas the Forward algorithm computes the single most likely state at a given time. Using the Forward algorithm to produce the most likely state at each time step does not necessarily produce the same state sequence that Viterbi does. Indeed, running full filtering/smoothing with the Forward/Backward algorithm does not necessarily produce the same state sequence as Viterbi.

This may seem like quibbling, but mathematically, they are very different things.

I already detailed some of this in the talk page on the Talk:Forward algorithm... because I was sad. Sad that Wikipedia was so confused. Avidelego (talk) 19:18, 14 April 2010 (UTC)

 * It seems someone listened as there's now a separate page for it. I've replaced the code with something I think is better, but I still think the state of this page is abysmal. 128.237.249.50 (talk) 20:35, 2 May 2010 (UTC)

Too much code
The main page has a lot of code, and I think this really dilutes the content. As an article reader, I don't want to read through code, no matter how well written it is. Also, the weather/activity example is good, but it leaves it to code to explain the probabilities -- this should be in a table (or, maybe the diagram is sufficient). The trellis diagram is worth a thousand lines of code -- nice job on this. Can't we put the code on the talk page or something? Lavaka (talk) 18:11, 18 November 2010 (UTC)

 * I join in the chant, the Viterbi algorithm is a masterpiece yet the article can't stand up its fame: to the unexperienced reader, the code is not the only thing of interest and working out the example a little more (i.e. showing the score calculations and the core idea of what path should be picked in the graph) would be great. --Reim (talk) 17:03, 14 April 2011 (UTC)

 * I think that some algorithmic walk-through is pretty helpful, which to me means the python example should stay - it's quite readable. Not clear why an encyclopedia article should have a second implementation (i.e. the java one) pasted in the middle of it too... I'd like to see Wikipedia or Wikimedia more generally making this kind of basic code available, but is there a better place it cna be moved? A wikibook? --mcld (talk) 12:32, 2 December 2011 (UTC)

OH GOD NOW THERE'S FAR TOO MUCH CODE. Someone just added an F# implementation, as well as the existing Java, Clojure, C#, oh help me please. These programming languages are each lovely but there's just no way a reader wants to scroll past many different implementations in an ENCYCLOPEDIA article. I'm going to Be Bold and delete some of it. --mcld (talk) 20:48, 3 May 2012 (UTC)
 * Seems like it was the right change :-) When I read the article as it is now, I thought it very well written and understandable, with just the right amount of code (one Python implementation). The "Pseudocode" section however seemed very dense (and possibly superfluous, though perhaps non-coder mathematicians find it useful), while the "Extensions" section seemed a bit short. Unhammer (talk) 08:48, 12 November 2014 (UTC)

Numbers again
Like so many before, I looked for a simple as possible explanation of the algorithm. But my eye was caught by the figure

 * .0134

This is clearly not the probability of the most likely set of weather conditions given Walk-Shop-Clean, since there are only 8 conditions the most likely needs to be > 0.125.

I guessed (correctly as it turned out) that this is the probability ab initio of Sunny-rainy-rainy(SRR) AND Walk-Shop-Clean(WSC) - and not something that we need an algorithm for.

The probability of SRR given WSC is actually 18.91%, computable by Bayes theorem. What the Viterbi algorithm does, presumably is allow us to derive the most probable state without computing the probabilities for all states, otherwise it would be just brute force. That is what should be made clear in the article. Rich Farmbrough, 14:30, 8 February 2011 (UTC).

Assumption
"Third, computing the most likely hidden sequence up to a certain point t must depend only on the observed event at point t, and the most likely sequence at point t − 1."

This does not appear a valid assumption.

Example:

Initial probability

πX= 0.99, πA= 0.01.

Transitions

Now we see emitted 0,1,0,1,0,1 the most likely path is X,Y,X,Y,X,Y,X. However if the next value emitted is 17, the most likely (and only) path is ABABABAC.

 * Rich Farmbrough, 16:03, 8 February 2011 (UTC).

 * Your example is correct. At step 6, the Viterbi algorithm would remember the path XYXYXY as the most likely way to get to Y, and ABABAB as the most likely way to get to B. If you ask it for the "viterbi path" at that point you'll get the former. At step 7 the paths are updated. If you then ask for the "viterbi path" you get one based on the latter. Maybe the phrase "and the most likely sequence at point t − 1" should be "and the most likely sequence leading to each possible state at point t − 1"? Bit clunky? --mcld (talk) 12:41, 2 December 2011 (UTC)

Corresponds to time
I don't understand the following sentence: "This sequence often corresponds to time." Is it a function of time, or only time-dependent, or something else? JMK (talk) 14:53, 30 March 2011 (UTC)
 * The sequence is often strictly monotonic in time, i.e. time-ordered. Is that clearer? I don't think "monotonic" is a good word to put in the intro... --mcld (talk) 12:35, 2 December 2011 (UTC)

Robotics project attention needed
Chaosdruid (talk) 11:16, 24 March 2012 (UTC)
 * MoS checks
 * Refs - enough?
 * Content - all topics covered?
 * Reassess

Incorrect Result for Health Clinic Example
For the health clinic example, I get that the most likely sequence of states given observations { 'normal', 'cold', 'dizzy' } is { "Healthy', 'Healthy', 'Fever' }, not { "Healthy', 'Fever', 'Fever' } as the article presently reads. See table below for brute force calculatation.

I believe I see how this error crept in. In its previous form, when the example was about predicting whether the weather was SUNNY or RAINY from Bob's activities, the answer was correct. The author that rewrote the example to be about determining whether a patient was HEALTHY or had a FEVER thought they were doing a simple label replacement so all the math would come out the same. However they actually swapped the observation distributions, changing the mathematical model and likewise the maximum likelihood state trajectory given the example observations. Ooops! Note that the "trellis" diagram is now wrong.

THIS STILL HASN'T BEEN ADDRESSED!!!!!!!!!!!!!!!!!!!!!!!!!!!!! — Preceding unsigned comment added by 24.202.146.187 (talk) 02:20, 27 February 2016 (UTC)

Elvenhack (talk) 06:48, 24 May 2012 (UTC)

Algorithm definition: State variable name changes from "i" to "k"?
At the beginning the state is defined with the variable "i" but then this variable doesn't occur in the formulas, only "k". Is this an error? 2001:638:902:200B:68B5:F304:56D6:2AC8 (talk) 12:53, 12 September 2012 (UTC)
 * I think that this might be intentional to keep readers from mixing up the two; where one part is the definition of the variables, the other, the definition of the algorithm. The way I see it "i" and "j" (neither of which appear again) refer to arbitrary states, simply for evaluating transition probabilities; whereas "k" denotes a state in a broader context, for which you are asking the probability of that particular state being the final emitting state after a certain number of time steps, given the observations. PrincessKhorde (talk) 09:01, 19 November 2012 (UTC)

Python code
I decided to remove the Python code because (a) this is an encyclopedia, not a source code repository, and (b) it was completely broken. Since software maintenance on Wikipedia is practically impossible (there are broken code examples in many articles), I suggest we leave it out and improve the pseudocode instead. Jurafsky and Martin, 2nd ed., have a nice pseudocode version on page 220. Q VVERTYVS (hm?) 15:03, 17 July 2013 (UTC)
 * Please do not simply remove portions from an encyclopedic article simply because you feel like it. First of all, the Python implementation does work exactly as expected.  It's possible that you have an older version of Python installed which fails to run it properly.  Secondly, the Python implementation is illustrative of the algorithm and contributes to this article.  Removal of the Python code is a step backwards.  Please feel free to make contributions to Wikipedia articles, but do not impetuously remove content.  --Alex Rosenberg (talk) 02:32, 21 July 2013 (UTC)

I fixed a couple of minor bugs in the Python code. Documented in the change description. Insignificant1 (talk) 23:53, 31 October 2013 (UTC)

The Python function does not seem make use of the `start_p` initial probabilities at all.Jpo742 (talk) 01:30, 12 February 2016 (UTC)

Pseudo-Code seems wrong
If you follow the logic of the pseudo-code it does not match the health clinic example.

From the state transition from state t=1 to t=2.

There should be path probabilities as follows:

H-H = 0.3*0.7*0.4 = 0.084

H-T = 0.3*0.3*0.3 = 0.027

T-H = 0.04*0.4*0.4 = 0.0064

T-T = 0.04*0.6*0.3 = 0.0072

The pseudo code states that:

T_1[j,i] <- max_k (T_1[k, i-1]*A_{k,j} * B_{j,yi})

I think it should be

T_1[j,1] <- max_k (T_1[j, i-1] * A_{k,j} * B_{j, yi})

Is this article "too technical?"
Which concepts in this article are "too technical" for readers to understand? Jarble (talk) 19:55, 27 January 2024 (UTC)

title: Talk:Viterbi algorithm


text:
User:Naturenet

Salutations
Find out about me by reading my contributions, if that's your bag.

There's also no end of other stuff about me elsewhere on the web which you could find if you really can be bothered... happy hunting.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User:Naturenet


text:
Pepin of Italy

Pepin or Pippin (777 – 8 July 810) was King of Italy from 781 until his death in 810. Born Carloman, he was the third son of Charlemagne (his second by Queen Hildegard). Carloman was renamed Pepin upon his baptism in 781, where he was also crowned as king of the Lombard Kingdom his father had conquered. Pepin ruled the kingdom from a young age under Charlemagne, but predeceased his father. His son Bernard was named king of Italy after him, and his descendants were the longest-surviving direct male line of the Carolingian dynasty.

Life
Carloman born in 777, the second son of Charlemagne and his wife Hildegard. Carloman had an older brother, Charles the Younger, and half brother Pepin the Hunchback, Charlemagne's eldest son. Charlemagne had been king of the Franks since 768, and in 774 conquered the Kingdom of the Lombards in northern Italy, partially on the request of Pope Adrian I for assistance against the Lombard king Desiderius. In 781, Charlemagne and Hildegard brought Carloman along with his younger brother Louis the Pious and sisters Rotrude and Bertha, daughter of Charlemagne to Rome at Adrian's request. Carloman was four years old, but his parents had delayed his baptism so that the Pope could perform it. Carloman was baptized, and Adrian then crowned him as king of the Lombards (later styled king of Italy) and his brother Louis as king of Aquitaine. As part of Carloman's baptism, he was renamed Pepin, now sharing a name with his half-brother. The reason behind the name change is obscure, but it was likely chosen to evoke the memory of his grandfather Pepin the Short, remembered as a staunch ally of the papacy, and this legacy was important to emphasize for the young king who was to rule Italy.

Though only four years old, Pepin's coronation was not nominal—he was brought to Lombardy to live under the care of advisors provided by Charlemagne,the most important of which were Adalard of Corbie, Waldo of Reichenau, the Lombard duke Rotchild, and Angilbert. Pepin's court was based primarily at Verona, though he also operated from palaces in Mantua and the traditional Lombard capital of Pavia. Pepin was king in his own name, but Charlemagne took a strong hand in Italy even into Pepin's adulthood, even on occasion issuing laws directly.

After Pepin came of age, he began fulfilling his role as a military leader. He participated in his father's campaign against Tassilo III of Bavaria in 786. In 796, he led a campaign against the Avar Khaganate, taking their stronghold and precipitating the collapse of the Avar state, allowing the Frankish realm to expand eastward. Pepin's victory was celebrated in the contemporary Latin poem De Pippini regis Victoria Avarica. Pepin also led multiple raids against the Duchy of Benevento and a successful campaign in 810 against the Republic of Venice.

In 806, Charlemagne gathered his sons and issued the Divisio Regnorum, which outlined formalized plans for the inheritance of the empire upon his death. Pepin was confirmed in this rule of Italy while also gaining most of Bavaria and Alamannia; Louis gained Provence, Septimania, and most of Burgundy in addition to Aquitaine; and Charles as his eldest son in good favour (Pepin the Hunchback having been confined to a monastery after a failed rebellion), was given the largest share of the inheritance, with rule of Francia proper along with Saxony, Nordgau, and parts of Alemannia. Charlemagne did not address the inheritance of the title of emperor he had gained in 800. The Divisio also addressed the death of any of the brothers, and urged peace between them and between any of their nephews who might inherit.

Charlemagne's succession plans did not come to fruition. Pepin died on 8 July 810, followed in quick succession by the deaths of his sister Rotrude, his aunt Gisela, Abbess of Chelles, and his half brother Pepin, and his brother Charles over the course of 810–811. All were possibly victims of an epidemic that had spread from cattle in 810. In the wake of these deaths, Charlemagne declared Pepin's son Bernard ruler of Italy, and his own only surviving son Louis as heir to the rest of the empire. Louis and Bernard were formally invested as Charlemagne's heirs in September of 813, and would fully succeed upon his death in 814.

Family and descendants
Pepin was married to Theodrada, who was his father's cousin and sister to his advisor Adalard. His brother Louis would use the close relation between Pepin and his wife to portray the marriage as illegitimate in order to sideline Bernard. Bernard's male-line descendants continued to rule as counts of Vermandois in Italy into the eleventh century, longer than any other agnatic descendants of Charlemagne. In addition to Bernard, Pepin had five daughters: Adalhaid (the wife of Lambert I of Nantes and mother of Guy I of Spoleto), Arula, Gundrada, Berthaid, and Theodrada. After Pepin's death, Charlemagne took the girls into his own household.

title: Pepin of Italy


text:
Powell River (Tennessee River tributary)

The Powell River is a 195-mile-long river in the United States that rises in Southwest Virginia and flows southwest into East Tennessee.

The South Fork of the river rises in rural Wise County, Virginia, near the Laurel Grove community northwest of Norton and flows for several miles before the confluence with Roaring Fork in the Kent Junction community. From Kent Junction the river flows until it meets the North Fork of the river near Woodway, Virginia. The North Folk originates near Keokee, Virginia. The river flows past Big Stone Gap, Virginia, and then runs nearly the entire length of Lee County, Virginia. It drains approximately 954 square miles (2,471 km2) in both Virginia and Tennessee before reaching its confluence with the Clinch River in the Norris Lake reservoir at the site of the town of Grantsboro, Tennessee.

The Powell River was named for Ambrose Powell who accompanied the exploration party of Dr. Thomas Walker in the mid-18th century. Legend has it that his name appeared so frequently carved on trees in the valley of this river that later explorers and early pioneers came to call the stream "Powell's River" and the valley "Powell's Valley".

The Powell River was designated by the Environmental Protection Agency (EPA) as the “second most biologically diverse aquatic system in the nation.” The Powell is under pressure from the effects of mining (including strip mining), logging and associated road-building.

Lincoln Memorial University operates the Powell River Aquatic Research Station, which is located where Tennessee State Route 63 crosses the river at the Brooks Bridge in Claiborne County, Tennessee. The center allows for on-site research of water quality, flora, fauna and related habitat.

Fishing in the Powell River can be great in some areas; in Wise County the Virginia Department of Wildlife Resources stocks trout in the shallow rushing waters of the Middle Fork under a "delayed harvest" designation. Downstream from Lee County, the river is home to smallmouth bass, largemouth bass, red eye bass, bluegill, carp, red horses, walleye, sauger and even musky. A lot of people kayak the river and even wade to fish.


text: Category:Adenosine diphosphate receptor inhibitors


text:
Powell River, British Columbia

Powell River is a city on the northern Sunshine Coast of southwestern British Columbia, Canada. Most of its population lives near the eastern shores of Malaspina Strait, which is part of the larger Georgia Strait between Vancouver Island and the Mainland. With two intervening long, steep-sided fjords inhibiting the construction of a contiguous road connection with Vancouver to the south, geographical surroundings explain Powell River's remoteness as a community, despite relative proximity to Vancouver and other populous areas of the BC Coast. The city is the location of the head office of the qathet Regional District.

History

The Powell River was named for Israel Wood Powell. Powell was B.C.'s first superintendent for Indian Affairs and a chief architect of colonial policies, including the establishment of residential schools in British Columbia and the banning of the Potlatch. He was traveling up the coast of BC in 1881 and the river and lake were named after him.

Powell was a supporter of B.C. being part of the union with Canada and brought the first Canadian flag to BC on June 17, 1871.

The pulp mill was started in 1908, with a corresponding townsite company town commenced in 1910: the first roll of paper was produced at Powell River Mill in 1912. Similarly, large logging companies had earlier moved in to take advantage of the huge timber. Brooks, Scanlon & Obrien; Bloedel, Stewart and Welch; and Theodosia Logging were but a few logging companies, with the Brooks brothers and M.J. Scanlon forming the Powell River Company, western Canada's first pulp and paper mill. The Historic Townsite was designated a National Historic Site of Canada in 1995, recognizing the exceptionally well preserved early 20th Century planned community, rooted firmly in the Garden City Design Movement and the Arts and Crafts philosophy.

When the British Columbia Credit Unions Act was passed in 1939, a study club organized by local millworkers secured the first charter with a deposit of $48.30. The mill provided a small office space at very low rent in the early years. By 1955, when the Powell River Credit Union (now 'First Credit Union') moved into a permanent office, it had over 3,000 members and $1 million in assets.

In March 1944, the Malahat began taking on water while being towed in the Barkley Sound. She was then moved to Powell River where she was made part of the breakwater.

The mill in Powell River was at one time the largest pulp and paper mill in the world. In its prime, one in every 25 newspapers in the world was printed on paper from the Powell River mill. However, since then it has significantly cut back on production and now produces newsprint and specialty papers for Catalyst Paper. In 2019, Paper Excellence Group acquired Catalyst Paper. In 2023, the mill was permanently curtailed.

The subsequent diversification of the local economy led to an increased focus on ecotourism and the arts, in addition to more traditional resources like mining, fishing, and general forestry. In recognition of its strong arts and cultural programs, Powell River was named a "Cultural Capital of Canada" in 2004.

The Powell River area is the current home to the Tla'amin Nation of the Mainland Comox branch of the Coast Salish peoples, who still reside there to this day. Their village is commonly referred to as Sliammon (the usual English adaptation of Tla'amin).

Name change
In May 2021, Tla'amin Nation submitted a request to Powell River city council to change the name of the city. The request comes because city namesake Israel Powell, B.C.’s superintendent of Indian affairs from 1872 to 1889, helped to ensure that the sale of Lot 450, land that included tiyskʷat village, went through, as well as overseeing the removal of children from their homes to be sent to residential schools, and the banning of potlatch, language and other Indigenous customs.

Sports teams
Powell River is host to the Powell River Kings, a member team of the British Columbia Hockey League, and the Powell River Regals, a Senior Men's hockey team, founded in 1955 and winner of 3 national and several provincial championships. The Powell River Villa play in the Vancouver Island Soccer League. Powell River also has many youth sports teams and associations.

PRMHA is the minor hockey associations with house & rep teams. Powell River's youth baseball league is called the PRMBA. It consists of divisions for are groups 5 and 18. Powell River's gymnastics association has produced many reputable gymnasts.

Attractions
In 2020, Powell River received a $10,000 grant from the government of British Columbia to support tourism in the town. Nearby, Texada Island with quiet beaches and lakes provides tourism opportunities and is a common weekend destination for the cities' residents. Both Texada Island and Powell River are popular for fishing, hunting, sailing, power boating camping and remote hiking.

The Spanish renaissance-style Patricia Theatre is Canada's oldest continuously operating theatre, first built in 1913 and then rebuilt in 1928. The qathet Museum and Archives depicts the interactions between the pioneers and First Nations as well as showing the tools and items that would have been used by those groups. The Townsite Heritage Society was formed in 1992 to maintain and promote the historical character of the traditional neighbourhood and business section of the Powell River Townsite.

Powell River hosts a number of festivals that highlight local interest and culture, including the Blackberry Festival, Pacific Region International Summer Music Academy (PRISMA) Festival, Logger Sports, Townsite Jazz Festival, International Choral Kathaumixw, and the Sunshine Music Festival.

The Cty of Powell River and surrounding area are home to over 300 Km’s of cycling trails. Volunteer built and maintained, the two largest areas for cycling are Duck Lake (XC riding) and Mount Mahony (Enduro riding). In 2023 after many years of work by the qathet Regional Cycling Association, the province of BC granted authority to the club to establish a new parking lot and professionally built climb and descent trails that continue to expand.

Powell River is home to the Sunshine Coast Trail, Canada's longest hut-to-hut hiking trail. The free-access 180 kilometre back-country trail meanders through a wide variety of landscapes, including coastal shorelines, old-growth forest, panoramic mountaintops, pristine creeks and lakes and salmon streams.

Transportation
While located on the mainland and not an island by definition, Powell River is a community isolated by ocean and mountains and is only accessible by water (BC Ferries) or by air (Powell River Airport). Powell River is located on Highway 101 but driving the length of the highway requires two ferries before arriving at Horseshoe Bay in West Vancouver. The alternative access to the town is a ferry crossing from Comox on Vancouver Island. Since the Sunshine Coast is similarly isolated from the rest of the BC mainland, vehicles from Vancouver must take two ferries to reach Powell River (across Howe Sound and the Jervis Inlet, if travelling via Sechelt; and across Georgia Strait twice if going via Nanaimo). The surrounding inlets (fjords) banked by mountainous terrain have made land based road connections to other areas of the BC mainland an expensive proposal. One land based route connecting Powell River to Highway 99 near Squamish has been studied, but would require two tunnels (4.5 km and 8.0 km long) and cost around 5 billion dollars. All of the city's roads are two-lane residential roads, and Highway 101 merges with Marine Avenue to form the city's main street.

Powell River has two ferry terminals, both of which belong to BC Ferries. The Westview Ferry Terminal is located near the city's downtown and provides service to Comox and Vancouver Island on board the Salish Eagle, and to Texada Island on the Island Discovery. The Saltery Bay Ferry Terminal is located 23 km south on Highway 101 and provides access to the Sunshine Coast on the Malaspina Sky via route to Earl's Cove near Skookumchuck Narrows.

Powell River has a small airport with a single 1,200 meter long runway and indoor waiting terminal. It is serviced by Pacific Coastal Airlines, which offers 20- to 25-minute flights between Powell River Airport and the South Terminal of Vancouver's International Airport. Charter flights and private aircraft also make use the runway on a regular basis.

The City of Powell River also has a small network of public transportation bus routes, run by BC Transit with 6 routes.

City of Powell River
The City of Powell River includes the original Townsite, which became designated a National Historic District in 1995, one of only seven in Canada. There is also the more populous Westview, and the Cranberry and Wildwood areas. On October 15, 2005, coinciding with its 50th anniversary of incorporation, Powell River was officially designated a city.

Townsite and Cranberry are connected by three roads by the names of Lombardy Ave, Timberlane Ave, and Hemlock Street.

Demographics
In the 2021 Census of Population conducted by Statistics Canada, Powell River had a population of 13,943 living in 6,402 of its 6,718 total private dwellings, a change of NaN% from its 2016 population of 13,157. With a land area of 28.91 km2, it had a population density of in 2021.

The median household income in 2005 for Powell River was $46,777, which is below the British Columbia provincial average of $52,709.

Religion
According to the 2021 census, religious groups in Powell River included:
 * Irreligion (8,405 persons or 61.6%)
 * Christianity (4,855 persons or 35.6%)
 * Hinduism (60 persons or 0.4%)
 * Buddhism (50 persons or 0.4%)
 * Sikhism (35 persons or 0.3%)
 * Judaism (30 persons or 0.2%)
 * Indigenous Spirituality (25 persons or 0.2%)
 * Islam (20 persons or 0.1%)

Climate and ecosystem
The city has an exceptional Mediterranean climate of the warm-summer type (Köppen: Csb), resulting in the most northerly location in the northern hemisphere, being that in Europe it is 5° further south. Although the hot season is dry, the vegetation reflects its location west of the mid-latitudes and who can describe the climate differently being situated within a temperate rainforest, Coastal Western Hemlock biogeoclimatic zone the mild winters and high humidity (although it has a defined dry season) it owns a wide zone of growth with firs, cedars and conifers. On average, the CWH is the rainiest biogeoclimatic zone in British Columbia. The zone typically has a cool mesothermal climate: cool summers (although hot dry spells can be frequent) and mild winters.

Mean annual temperature is about 8 C and ranges from 5.2 to 10.5 °C among the CWH subzones. The mean monthly temperature is above 10 C for 4–6 months of the year. The mean temperature of the coldest month is 0.2 C and ranges from -6.6 to 4.7 °C among the subzones. Mean annual precipitation for the zone as a whole is 2228 mm, and ranges from 1000 to 4400 mm (and probably more in some areas). Less than 15% of total precipitation occurs as snowfall in the south, but as much as 40-50% in the northern parts of the zone.

Education
A regional campus of Vancouver Island University is located in Powell River. This campus is called tiwšɛmawtxw (tyew-shem-out), which means house of learning. The name was a gift to the institution from the Tla’amin Nation Executive Council to acknowledge VIU's "readiness and willingness to participate and engage in meaningful reconciliation."

The Powell River School Board (School District 47 Powell River) operates eight schools which includes Brooks Secondary School (high school), James Thomson, Henderson, Edgehill, Grief Point (now the location of Powell River Christian School), Kelly Creek, and Texada (elementaries) as well as Westview Learning Centre. In 2013, A brand new $15.6 million Elementary school named Westview Elementary was opened. It is the replacement of the old Grief Point School.

The Conseil scolaire francophone de la Colombie-Britannique operates two Francophone schools: école Côte-du-soleil (primary and junior high school) and école secondaire Brooks.

Private Other elementary schools in the region include Assumption Catholic School (Pre-School, K-9) and Powell River Christian School (Pre-School, K-9).

Power supply
East of Saltery Bay, a powerline crosses Jervis Inlet on a span of 3.1 kilometres (1.9 mi).

title: Powell River, British Columbia


text:
Talk:Crispin Glover

Use of an actor to look like another actor
In this Wikipedia article and in "Back to the Future Part II" article is reference to Crispin Glover lawsuit and a resulting prohibition of such practice. I just saw that this would involve replacement of a living actor; permission can be granted for exception, to finish a film after an actor dies. Carlm0404 (talk) 02:23, 18 October 2018 (UTC)

 * See Fake Shemp article. •  Sbmeirow  •  Talk  • 12:56, 5 April 2020 (UTC)

I agree. The theory that he did this as a prescient and oddly-timed promo about a movie four years out from release... It doesn't hold water. It's a flattering theory for him; if it were true he'd have confirmed it. His silence speaks volumes. Ichthyosaur613 (talk) 05:35, 25 August 2022 (UTC)

Whoops, I commented this in the wrong place - don't know how to delete comments. Ichthyosaur613 (talk) 05:39, 25 August 2022 (UTC)

Late Night appearance
The whole section on Glover's Late Night Appearance lacks any sources to establish that Glover did his schtick on the show as part of a movie promo. The YouTube video of an interview with Glover does not establish this alternate narrative as Glover talks in circles and refuses to say anything definite. If this section was included on any other Wikipedia page it would be deleted for lack of a verifiable source. — Preceding unsigned comment added by 2604:6000:E48B:B600:610F:800A:7597:7CF7 (talk) 11:39, 1 June 2020 (UTC)

Note about the "air of mystery" lacking citation: that comes from an interview he did with Jimmy Kimmel, though, I don't know when. ~ the meccaneer (talk) 20:59, 5 November 2021 (UTC)

Trying again to post!

I agree. The theory that he did this as a prescient and oddly-timed promo about a movie four years out from release... It doesn't hold water. It's a flattering theory for him; if it were true he'd have confirmed it.

An objective article doesn't need to opine like that, of course, but it also doesn't need to uncritically pass along everything Glover says about this. Ichthyosaur613 (talk) 05:42, 25 August 2022 (UTC)

title: Talk:Crispin Glover


text:
User:Hippogriff

I am a computer programmer with a bachelor's degree in mathematics and computer science. In my free time, I love studying the German language, reading fiction, watching fantastical or children's television programmes, and generally learning new things. I also love spiritual poetry and chess. My religion is the Baha'i Faith.

title: User:Hippogriff


text:
Talk:Jay Garner

Jay Garner getting replaced by Paul Bremer
I always understood that Garner was a military guy, who was going to work with military leaders and continue the heavy fighting and peace-keeping mission. Paul Bremer was the statesman who was going to work with the civilians, write a constitution, and transition to democracy. In other words, they moved Garner in to rule with an iron fist and get the job done, no matter what. Bremer shows up when there is enough stability to begin the transition. I understood that the transition was a signal that things went better than planned. Remember, right after the "Mission Accomplished" banner, things were relatively quiet over there, except for the looting. I think it's a bit unfair that there is so much cricism about Garner's replacement. Shouldn't we just say, "Garner was replaced"? We can mention the scandals, but let's focus on the good things he's done as well. Jgardner 07:53, 2004 Oct 15 (UTC)

The criticism of the choice of Garner needs to be explained and the critics identified for this section to be considered verifiable. patsw 17:17, 20 January 2006 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Jay Garner. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20060618005914/http://www.zmag.org/content/showarticle.cfm?SectionID=15&ItemID=10399 to http://www.zmag.org/content/showarticle.cfm?SectionID=15&ItemID=10399

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 12:35, 9 December 2017 (UTC)

title: Talk:Jay Garner


text:
Timurid

Timurid refers to those descended from Timur (Tamerlane), a 14th-century conqueror:

 * Timurid dynasty, a dynasty of Turco-Mongol lineage descended from Timur who established empires in Central Asia and the Indian subcontinent
 * Timurid Empire of Central Asia, founded by Timur
 * Mughal Empire of the Indian subcontinent, founded by Timur's descendants (also sometimes referred to as the 'Timurid Empire')

title: Timurid


text:
Talk:Baseball Ground

Untitled
I've moved this back to just Baseball Ground, as I think we should try and avoid putting "The" in front of article names unless they definitely need it. It's obviously fine for albums, films etc, which have a precise title you can put in quotes, but "Baseball Ground" is just a name - the "the" can go in lower case and is just a part of speech. sjorford 07:56, 15 Oct 2004 (UTC)

 * But it's the 'the' that makes it obvious that one is talking about the Baseball Ground, not just a baseball ground. I'm not keen on having the definate article at the beginning of Wikipedia articles, but in this case I think it is needed. The Dell gets to keep its definate article. [comment added by anon]

 * Well, the capital "G" makes clear it's a proper noun - we might have an article called Baseball ground which would be about the general term. Of course, a notice at the top of the article would be a good idea in this case:
 * This article is about the stadium in England named the Baseball Ground; see baseball ground for baseball stadiums in general.
 * Not so sure about the Dell, perhaps? -- sjorford 14:45, 18 Oct 2004 (UTC)

Ownership
Here's a thought: how could Derby County have bought the ground from Sir Francis Lay in 1924 when he died in 1916? - Green Tentacle (talk) 23:41, 4 May 2009 (UTC)
 * I think that they bought the ground from Lay's estate. Velo  ciraptor  888  11:26, 18 April 2011 (UTC)

Relocate
'Relocate' must surely be the most OVERUSED word in the English language. Try 'Move' for a change.

title: Talk:Baseball Ground


text:
Talk:Land of Plenty

Untitled
This entry was made based on an interview with Kim Wenders in the Danish newspaper Politiken October 14, 2004 by Kim Skotte and a visit to Kim Wenders home page.--Hansjorn 07:56, Oct 15, 2004 (UTC)

Fair use rationale for Image:Land of plenty.jpg
Image:Land of plenty.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

Please go to the image description page and edit it to include a fair use rationale. Using one of the templates at Fair use rationale guideline is an easy way to insure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If there is other fair use media, consider checking that you have specified the fair use rationale on the other images used on this page. Note that any fair use images uploaded after 4 May, 2006, and lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.

BetacommandBot 23:57, 6 November 2007 (UTC)

title: Talk:Land of Plenty


text:
Strange Adventures

Strange Adventures is a series of American comic books published by DC Comics, the first of which was August–September 1950, according to the cover date, and published continuously until November 1973.

Original series
Strange Adventures ran for 244 issues and was DC Comics' first science fiction title. It began with an adaptation of the film Destination Moon. The sales success of the gorilla cover-featured story in Strange Adventures #8 (May 1951) led DC to produce numerous comic book covers with depictions of gorillas. The series was home to one of the last superheroes of the pre-Silver Age of Comic Books era, Captain Comet, created by writer John Broome and artist Carmine Infantino in issue #9. A combination of the "Captain Comet" feature with the "gorilla craze" was presented in issue #39 (December 1953). Other notable series included Star Hawkins which began in issue #114 (March 1960) and the Atomic Knights which debuted in issue #117 (June 1960).

In "The Strange Adventure That Really Happened" in issue #140 (May 1962), real life comics creators editor Julius Schwartz and artist Sid Greene struggle to make writer Gardner Fox recall a story he has written that holds the key to saving the Earth from alien invasion. In a rare acknowledgement of the rest of the DC universe in Strange Adventures, one panel mentions Gardner Fox having previously met the Flash in the iconic Silver Age story "Flash of Two Worlds".

Strange Adventures #180 (September 1965) introduced Animal Man in a story by Dave Wood and Carmine Infantino. The character was revived by writer Grant Morrison in 1988. Writer Bob Haney and artist Howard Purcell created the supernatural character the Enchantress in Strange Adventures #187 (April 1966). The Enchantress appears in the 2016 live-action movie Suicide Squad, portrayed by Cara Delevingne.

Initially a science fiction anthology title with some continuing features starring SF protagonists, the series became a supernatural-fantasy title beginning with issue #202, for which it received a new logo. Deadman's first appearance in Strange Adventures #205, written by Arnold Drake and drawn by Carmine Infantino, included the first known depiction of narcotics in a story approved by the Comics Code Authority. The "Deadman" feature served as an early showcase for the artwork of Neal Adams.

With issue #217, the title gained another new logo and began reprinting stories of Adam Strange and the Atomic Knights, among other stories. Several Strange Adventure stories were also reprinted in some of DC Comics' later anthologies such as From Beyond the Unknown.

In 1978, DC Comics intended to revive Strange Adventures. These plans were put on hold that year due to the DC Implosion, a line-wide scaling back of the company's publishing output. When the project was revived a year later, the title was changed to Time Warp and the series was in the Dollar Comics format.

Publication history
Continuing features in Strange Adventures included:
 * Chris KL-99 (issues #1–3, 5, 7, 9, 11, 15)
 * Darwin Jones (issues #1, 48, 58, 66, 70, 76, 77, 79, 84, 88, 93, 149, 160)
 * Captain Comet (issues #9–44, 46, 49) (cover feature many times)
 * Space Museum (issues #104, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 161)
 * Star Hawkins (issues #114, 119, 122, 125, 128, 131, 134, 137, 140, 143, 146, 149, 152, 155, 158, 162, 173, 176, 179, 182, 185)
 * Atomic Knights (issues #117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150, 153, 156, 160, with reprints in 217–231)
 * Faceless Creature from Saturn (issues #124, 142, 153)
 * Star Rovers (from Mystery in Space, #issues 159, 163)
 * Animal Man (issues #180, 184, 190, 195, 201)
 * Immortal Man (issues #177, 185, 190, 198)
 * Enchantress (issues #187, 191, 200)
 * Deadman (issues #205 to 216)
 * Adam Strange (reprints in #217 to 244; new stories in #222, 226 and 227 text stories with illustrations)

Awards
The series was nominated and awarded several awards over the years, including Alley Awards in 1963 for "General Fantasy", in 1965 for "Best Regularly Published Fantasy Comic", in 1966 for "Best Fantasy/SF/Supernatural Title", in 1967 for "Best Cover" (for issue #207 by Neal Adams), in 1967 for "Best Full-Length Story" ("Who's Been Lying in My Grave?" in issue #205 by Arnold Drake and Carmine Infantino), and the 1967 for "Best New Strip" ("Deadman" by Drake and Infantino).

Vertigo miniseries
In 1999, DC Comics' Vertigo imprint released a four-issue mini-series reviving the Strange Adventures title and concept.

It featured stories written by Brian Azzarello, Brian Bolland, Dave Gibbons, Bruce Jones, Joe R. Lansdale, John Ney Rieber, Robert Rodi, Doselle Young and Mark Schultz. Artists included Edvin Biuković, Richard Corben, Klaus Janson, Frank Quitely, James Romberger, and John Totleben. The miniseries is cover-dated November 1999 to February 2000.

JSA Strange Adventures
In 2004, Strange Adventures was again revived, in modified format, as the six-issue limited series JSA Strange Adventures, which presented a new Golden Age Justice Society of America story incorporating fantasy-fiction themes. It was written by Kevin J. Anderson, with art by Barry Kitson and Gary Erskine. The miniseries is cover-dated October 2004 to March 2005, and was collected in trade paperback in 2010.

Strange Adventures (2009)
Jim Starlin wrote an eight-issue limited series called Strange Adventures which focused on Adam Strange, Bizarro and Captain Comet, which started in May 2009. This series continued the "Aberrant Six" storyline, as well as plot developments from the Rann/Thanagar Holy War and Countdown to Adventure. This series was collected in trade paperback in 2010.

Strange Adventures (2011 Vertigo one-shot)
An 80-page Strange Adventures #1, an anthology one-shot, with short science fiction and fantasy stories was released with a July 2011 cover date. Contributing writers and artists include Peter Milligan, Scott Snyder, Jeff Lemire, Brian Azzarello, Eduardo Risso, Paul Pope, and Paul Cornell.

Strange Adventures (2020 DC Black Label series)
A new Strange Adventures series was written by Tom King with Mitch Gerads and Doc Shaner. The series was released in March 2020, under the DC Black Label imprint. The limited series ran for 12 issues, ending in October 2021. For the 2022 Hugo Awards, the series received an award in the Best Graphic Story category.

Collected editions

 * Captain Comet Archives Vol. 1 collects Captain Comet stories from Strange Adventures #9–44, 46, and 49, 400 pages, August 2013, ISBN 978-1401241087
 * Showcase Presents: Strange Adventures Vol. 1 collects Strange Adventures #54–73, 512 pages, December 2008, ISBN 1-4012-1544-0
 * Showcase Presents: Strange Adventures Vol. 2 collects Strange Adventures #74–93, 520 pages, November 2013, ISBN 978-1-4012-3846-9
 * The Steve Ditko Omnibus Volume 1 includes Strange Adventures #188: "Don't Bring That Monster to Life" by Otto Binder and Steve Ditko and Strange Adventures #189: "The Way-Out Worlds of Bertram Tilley" by Dave Wood and Ditko, 480 pages, September 2011, ISBN 1-4012-3111-X
 * DC Goes Ape collects Strange Adventures #201, 168 pages, October 2008, ISBN 978-1401219352
 * Deadman
 * The Deadman Collection hardcover collects Strange Adventures #205–216, 356 pages, December 2001, ISBN 1563898497
 * Deadman Vol. 1 trade paperback collects Strange Adventures #205–213, 176 pages, July 2011, ISBN 0857684175
 * Deadman Vol. 2 trade paperback collects Strange Adventures #214–216, 160 pages, February 2012, ISBN 1781160546
 * JSA: Strange Adventures collects JSA: Strange Adventures #1–6, 200 pages, February 2010, ISBN 1401225950
 * Strange Adventures collects Strange Adventures volume 3 #1–8, 256 pages, April 2010, ISBN 1401226175
 * Adam Strange: The Silver Age Omnibus collects (in addition to Showcase #17–19 and Mystery in Space #53–100, 102) Strange Adventures #157, 217, 218, 220, 221, 222, 224, 226, 235, and 241–243, 848 pages, July 2017, ISBN 9781401272951

In other media
In 2019, WarnerMedia and Greg Berlanti, the producer of The CW's Arrowverse, wanted to produce a "super hero anthology" series under the title Strange Adventures for the streaming service HBO Max. The series had reportedly been in development previously for the DC Universe streaming service. In August 2022, Kevin Smith, who was writing the script with Eric Carrasco, said that the series was cancelled.

title: Strange Adventures


text:
David Cunliffe

David Richard Cunliffe (born 30 April 1963) is a New Zealand management consultant and former politician who was Leader of the New Zealand Labour Party and Leader of the Opposition from September 2013 to September 2014. He was Member of Parliament (MP) for Titirangi and then New Lynn for the Labour Party between 1999 and 2017. He served as the Minister of Health, Minister for Communications and Information Technology and Minister of Immigration for the Fifth Labour Government of New Zealand from October 2007 until November 2008.

After the defeat of the Labour Party in the 2008 general election, and the resignation of Helen Clark as the party leader, Cunliffe was appointed the party's finance spokesman and number three on the front bench. After Labour lost the 2011 general election and Phil Goff stood down as party leader, Cunliffe ran for the leadership, but narrowly lost to David Shearer.

On 26 August 2013, Cunliffe announced a second leadership bid after David Shearer's departure from the leadership and was elected on 15 September 2013. Following Labour's defeat at the general election in September 2014, he resigned as leader of the Labour Party.

Early life
Cunliffe was born in Te Aroha on 30 April 1963. His family moved to Te Kūiti, then to Pleasant Point. His father, Bill, an Anglican minister, was active in the Labour Party. As a teenager he won a scholarship to study the International Baccalaureate at the United World College of the Atlantic in Wales. Cunliffe studied politics at the University of Otago, where he was a member of the Otago University Debating Society, and gained a BA with first-class honours. He worked as a diplomat from 1987 to 1994 and gained a Diploma in Social Sciences (Distinction) in economics from Massey University in 1993. He was a Fulbright Scholar and Kennedy Memorial Fellow at Harvard University’s John F. Kennedy School of Government, including some courses at Harvard Business and Law School in 1994 and 1995, earning a Master of Public Administration. He worked as a management consultant with The Boston Consulting Group in Auckland from 1995 to 1999.

Member of Parliament
Cunliffe was first elected to Parliament in the 1999 election, standing as the Labour candidate for the Titirangi seat. Labour formed a new Government and Cunliffe served as Chair of the Commerce Select Committee and sat on the Finance and Expenditure and Regulations Review select committees.

Due to boundary changes for the 2002 election Cunliffe contested the seat of New Lynn, which he won. Cunliffe's party continued in Government for its second term and he was made a Parliamentary Private Secretary to the Ministers of Commerce, Finance and Revenue before being elevated to the Executive Council as a Minister outside of Cabinet in 2003. At the 2005 election, Cunliffe was returned in New Lynn with 18,087 votes (8,000 more than his nearest opponent) or 55% of the electorate vote, and also promoted into Cabinet.

Cunliffe retained his seat in the, , and s, during which the Labour Party was in Opposition. He served various senior roles, including as Finance Spokesperson, but was regarded as "a destabilising force" undermining the leadership of Labour Party leaders Phil Goff and David Shearer. Cunliffe was eventually elected as Labour Party Leader and Leader of the Opposition for twelve months in 2013 and 2014, including at the 2014 general election where the party received its worst result in 100 years.

Cunliffe's intention to retire from politics was announced by his successor, Andrew Little, on 1 November 2016. Cunliffe officially resigned from Parliament in April 2017, near enough to the 2017 election to avoid the need for a by-election.

Cabinet minister (2005–2008)
Cunliffe was appointed to the Cabinet of New Zealand in 2005 for the third term of the Fifth Labour Government, initially as the Minister of Immigration, Minister of Communications, Minister for Information Technology, and Associate Minister for Economic Development. He had previously held the Communications and Information Technology portfolios outside of Cabinet. A Cabinet reshuffle in 2007 saw him lose the Immigration portfolio in exchange for the more senior position as Minister of Health.

Immigration
As Immigration Minister in 2006, Cunliffe initiated a major review of the Immigration Act 1987 which, under the oversight of his successors, resulted in the eventual replacement of that Act with the new Immigration Act 2009.

Communications and Information Technology
Cunliffe served as an Associate Minister for Communications and Associate Minister for Information Technology from 2003 before being promoted to the primary portfolios in 2004. The two portfolios were merged into a single ministerial role in 2007.

As Minister for Communications and Information Technology he announced extensive pro-competitive reform of the telecommunications sector, including local loop unbundling and operational separation of then Telecom New Zealand.

In May 2006 Cunliffe was referred to the Securities Commission by the NZX for commenting on Telecom's future dividend plans, causing Telecom's stock price to drop. The Securities Commission found that no law had been breached and no action was taken.

On 30 June 2008 Cunliffe was conferred the title of Honorary Fellow of the NZCS (HFNZCS) by the New Zealand Computer Society, the professional body of the ICT profession in recognition of his significant contribution to the ICT sector.

Health
Cunliffe was promoted to the Health portfolio in 2007, replacing Pete Hodgson. He received some attention when, early in the portfolio, he said to his opposition counterpart Tony Ryall, "Mr Ryall, why don't you stay in your box. I'm running this show."

In February 2008, as the Minister of Health, Cunliffe dismissed the Hawke's Bay District Health Board over political, monetary and conflict of interest troubles. Napier Mayor Barbara Arnott and a number of members of the district voiced opposition to Cunliffe's move as many of the board members were democratically elected. Following the release of a Health Ministry-commissioned independent report into the matter, Cunliffe referred to the board as a "nasty little nest of self-perpetuating provincial elites".

In Opposition (2008–2013)
After the 2008 general election defeat of the Labour Party, Cunliffe was made Labour's spokesman for finance, shadowing National's Finance Minister, Bill English. Cunliffe had been touted as a future leader of the party, and party insiders had suggested he seriously considered challenging Phil Goff as leader in the aftermath of the 2008 election. Speculation of a leadership challenge again arose during the June 2010 expenses scandal and again after Chris Carter's resignation from the party.

After Labour lost the 2011 general election and Goff stood down, Cunliffe ran for the party leadership with Nanaia Mahuta on a ticket for deputy leader. Grant Robertson and David Parker also entered the race, but subsequently backed David Shearer, who won the high-profile race. Robertson became deputy leader, while Parker took Cunliffe's finance spokesmanship. Shearer retained Cunliffe in a senior role on the front bench, with the economic development and associate finance roles.

In November 2012 during a Labour Party conference, there was much media speculation Cunliffe would launch a challenge against David Shearer for leadership of the party. On the morning of 19 November, Cunliffe confirmed he was not challenging Shearer, and would indeed back him if a vote was taken. However, Cunliffe was accused of demonstrating disloyalty and subsequently stripped of his front bench position and his portfolios.

Labour Party leadership contest, 2013
On 22 August 2013, Shearer announced his resignation as leader of the Labour Party. Cunliffe was expected to make another bid for the leadership but did not confirm his candidacy immediately. Victoria University of Wellington's iPredict online predictions market showed the probability of Cunliffe becoming the next leader of the Labour Party at 66%, compared to under 26% support for Shearer's deputy Grant Robertson; social development spokesperson Jacinda Ardern polled at 5%, and list MP Andrew Little was on 2%.

Cunliffe formally entered the 2013 New Zealand Labour Party leadership election during a press conference in his New Lynn electorate office His announcement came in the wake of a ONE News Colmar Brunton poll released by the current affair programme Q+A which showed Cunliffe winning the support of 29% of the eligible voters asked, and 32% of those polled who support Labour. Challengers Shane Jones and Grant Robertson were on 11% and 10%, respectively. After the first public Labour Party leadership selection process in New Zealand history, Cunliffe was elected leader on 15 September 2013. He won with the support of 32% of the Labour Party caucus, 60% of Labour Party members, and 70% of affiliated unions.

Leader of the Opposition (2013–2014)
Cunliffe received strong backing from the party's grassroots membership, although his leadership bid was supported by only one-third of the caucus. Cunliffe's leadership was opposed by many Labour MPs; several of his colleagues came to see him as "divisive, ambitious, self-absorbed and self-confident to a messianic level". He was described as a "polarising" politician, however his election as leader resulting in an initial increase in support for Labour; it rose to 37% in opinion polls.

In a speech to a women's symposium in July 2014, Cunliffe stated, "I am sorry for being a man". He was commenting on domestic violence against women by men. His apology was regarded as insensitive, with Prime Minister John Key criticising the remark as "a bit insulting to imply that all men are abusive".

With little time to make the structural changes needed to build a proper campaign and a party marked by continued infighting, Labour performed poorly in the public opinion polls during the run-up to the 2014 general election. It was, as Cunliffe was to say later, "the craziest and in some ways the most unfortunate campaign in recorded memory".

2014 general election
Labour formally launched its campaign for 2014 general election in Auckland on 21 July. Cunliffe announced several flagship election policies, including a promise of free GP visits and prescriptions to pregnant women and those aged under 13 and over 65. In a speech he stated, "We are basing our policies on a very old idea. That your healthcare is based on your health need, not on the size of your wallet."

He was criticised for taking a three-day skiing holiday in Queenstown at the start of the campaign.

His performance in the leadership debates was viewed as mixed. Key claimed a win in the 2 September The Press leaders' debate after Cunliffe could not answer whether family homes held in a trust would be exempt under Labour's capital gains tax policy, but then went on to recover in the second and third debates.

Cunliffe's Labour Party received 25.1% of the party vote and 32 seats, its lowest share of the vote since 1922, while the National Party gained a plurality with 47.0% of the party vote, its best result since 1951. Cunliffe initially vowed to remain as the party leader, in spite of the poor election result. On 27 September Cunliffe formally resigned as leader but announced he was re-contesting in the 2014 party leadership election. Later on 13 October, he announced he was pulling out of the leadership race.

Political views
Cunliffe is generally liberal when it comes to conscience issues. He voted in favour of the decriminalisation of prostitution, the establishment of civil unions, and the criminalisation of parental corporal punishment. He voted against defining marriage as between one man and one woman, and in 2013, he voted in favour of legalising same-sex marriage. In 2006, he voted in favour of raising the legal drinking age from 18 to 20, but voted against it in 2012.

Cunliffe has expressed a view that New Zealand will become a republic in the future. During a debate after the speech from the throne on 4 September 2002, Cunliffe spoke of "Building a New Zealand ... where we journey together towards maturity as a nation, and to the Commonwealth republic I personally believe we will become before the Treaty turns 200".

Life after politics
Following his retirement from Parliament on 21 April 2017, Cunliffe joined the New Zealand-based management consultancy firm Stakeholder Strategies as a partner, working for a range of public and private sector clients. He left the company in 2020. Since 2020 he has been a director of the Polis Consulting Group.

In the 2018 New Year Honours, Cunliffe was appointed a Companion of the Queen's Service Order, for services as a member of Parliament.

In February 2020, Cunliffe was also appointed as chair of the Selwyn Foundation, one of New Zealand's largest independent charitable providers of services to older people and their families.

Family
Cunliffe's domestic partner is Anna Kominik. Kominik is the independent chair of the Electricity Retailers’ Association and the New Zealand Director of Zephyr Airworks. He has two sons from his previous marriage to Auckland lawyer Karen Price. Cunliffe's father Bill was born in Ngahere in 1915 and worked at the railways. His great-grandfather, William Cunliffe, married Phoebe Seddon, the elder sister of Richard Seddon, who would later become known as 'King Dick'. Seddon, New Zealand's longest serving prime minister, was thus Cunliffe's great-(great-)uncle.

Religious views
Cunliffe is the son of an Anglican minister, and was raised in the Church of England. He has described himself as a "liberal Anglican," and an "infrequent attender of church, but it's a big part of my life."

title: David Cunliffe


text:
Martin Goodman

Martin Goodman may refer to:
 * Martin Goodman (historian) (born 1953), British historian and academic
 * Martin Goodman (publisher) (1908–1992), American publisher of pulp magazines, paperbacks, adventure magazines, and comic books
 * Martin J. Goodman (born 1956), English author and journalist
 * Martin Wise Goodman, Canadian journalist, editor-in-chief of The Toronto Star
 * Martin Goodman, character in British sitcom Friday Night Dinner

title: Martin Goodman


text:
Sunshine Coast (British Columbia)

The Sunshine Coast is a geographic subregion of the British Columbia Coast that generally comprises the regional districts of qathet and Sunshine Coast.

While populous and frequently visited by tourists, the Sunshine Coast can be reached only by ferry (commonly BC Ferries) or by floatplane, as no access roads have been built around or across the fjords separating it from the rest of the province. It can also be reached via private or chartered aircraft using the Sechelt Aerodrome (CAP3).

Geography
The Sunshine Coast is a subregion of the mainland coast of British Columbia. It is bound by Howe Sound to the southeast, Desolation Sound to the northwest, the Pacific Ranges to the northeast, and the Strait of Georgia to the southwest. The region is bisected by Jervis Inlet. The region features a coastal lowland that gradually transitions to steep-sided mountains as you move toward the northeast.

The major islands of the Sunshine Coast include Anvil Island, Gambier Island, Goat Island, Hernando Island, Keats Island, Savary Island, and most of the Northern Gulf Islands.

Ecology
The Coast's wildlife includes cougars, black bears, wolves, marbled murrelet, orcas, great blue herons, seals, sea lions and bald eagles. There are also abundant tide pools with a variety of molluscs, sea anemones and fish.

At certain times of the year, seal pups may be encountered on the Coast's beaches. They should not be approached, as the mother may abandon them. All wildlife on the Coast should be viewed from a safe and respectful distance.

Climate
The lowlands have a warm-summer Mediterranean climate (Köppen: Csb) with warm, dry summers and cool, wet winters. Higher elevations feature a marine west coast climate (Köppen: Cfb) with warm summers, mild winters, and moderate rainfall throughout the year.

Demographics
As of the 2016 census, the population of the Sunshine Coast totals 50,040:
 * 29,970 in the Sunshine Coast Regional District
 * 20,070 in qathet Regional District

Major communities
The major communities of the Sunshine Coast are as follows:
 * Powell River (pop. 13,157)
 * Sechelt (pop. 10,200)
 * Gibsons (pop. 4,605)
 * Roberts Creek (pop. 3,421)

Economy
Historically, the economy of the Sunshine Coast was driven primarily by industries such as logging and mining.

Today, forestry and tourism form much of the local economy.

Culture
The Sunshine Coast is home to more artists per capita than any other Canadian region. Purple flags along the Sunshine Coast Highway and local streets indicate artists's studios where the public is welcome, and which feature many disciplines including painting, pottery and glassblowing.

Transportation
Due to its mountainous terrain, the Sunshine Coast is not directly linked over land to the surrounding coast. Instead, BC Ferries provides ferry service linking the coast to surrounding regions. Notable lines include Horseshoe Bay-Langdale, Little River-Westview, and Earls Cove-Saltery Bay. Minor ferry operators and water taxis provide service to minor islands dotting the strait.

The region is served by British Columbia Highway 101, which runs along the coast between the communities of Langdale and Lund.

Attractions
Some attractions specific to the Sunshine Coast include:
 * Copeland Islands Marine Provincial Park
 * Desolation Sound Marine Provincial Park
 * Hidden Grove/Sechelt Heritage Forest
 * Skookumchuck Narrows Provincial Park
 * Smuggler Cove Marine Provincial Park
 * tems swiya Museum - showcasing history and culture of the shíshálh people
 * The northern terminus of Highway 101, which is located in the town of Lund

The region also features two notable trails:
 * Powell Forest Canoe Route - a 57 km canoeing route through various lakes north of Powell River
 * Sunshine Coast Trail - a 180 km long hiking trail between Saltery Bay and Sarah Point

title: Sunshine Coast (British Columbia)