( ( ( ( ParsimonyUnordered ( -LRB- ( `` ( ( ( Parsimony Unordered ) '' ) -RRB- ) ) ) ) -- ) ( ( Calculates ( the ( ( most ( parsimonious ancestral ) ) states ) ) ) ( at ( ( the nodes ) ( of ( ( ( the tree ) ( assuming ( ( one step ) ( per ( state change ) ) ) ) ) ( -LRB- ( ( ( this assumption ) ( is ( known ( as ( ( ( unordered or ) Fitch ) parsimony ) ) ) ) ) -RRB- ) ) ) ) ) ) ) ) . )
(ROOT (NP (NP (NNP ParsimonyUnordered)) (PRN (-LRB- -LRB-) (`` ``) (NP (NNP Parsimony) (NNP Unordered)) ('' '') (-RRB- -RRB-)) (: --) (NP (NP (NP (NNP Calculates)) (NP (DT the) (ADJP (RBS most) (JJ parsimonious) (JJ ancestral)) (NNS states))) (PP (IN at) (NP (NP (DT the) (NNS nodes)) (PP (IN of) (NP (NP (DT the) (NN tree)) (VP (VBG assuming) (NP (NP (CD one) (NN step)) (PP (IN per) (NP (NN state) (NN change))))) (PRN (-LRB- -LRB-) (S (NP (DT this) (NN assumption)) (VP (VBZ is) (VP (VBN known) (PP (IN as) (NP (ADJP (JJ unordered) (CC or) (JJ Fitch)) (NN parsimony)))))) (-RRB- -RRB-))))))) (. .)))
ParsimonyUnordered (&quot;Parsimony Unordered&quot;) -- Calculates the most parsimonious ancestral states at the nodes of the tree assuming one step per state change (this assumption is known as unordered or Fitch parsimony).
(ROOT (S (NP (NP (DT The) (NN law)) (PP (IN of) (NP (NN parsimony)))) (VP (VBZ is) (NP (NP (DT the) (JJ scientific) (NN concept)) (VP (VBG stating) (SBAR (IN that) (S (SBAR (WHADVP (WRB when)) (S (VP (VBG looking) (PP (IN at) (NP (CD two))) (NP (VBG competing) (NNS theories))))) (, ,) (NP (NP (DT the) (NN one)) (PP (IN with) (NP (JJR fewer) (NNS assumptions)))) (VP (MD should) (VP (VB be) (VP (VBN chosen))))))))) (. .)))