( Parsimony ( ( The ( PARSIMONY programs ) ) ( ( ( make ( the assumption ) ) ( that ( ( the ( desired tree ) ) ( is ( ( ( the one ) ( with ( ( the ( fewest changes ) ) ( in it ) ) ) ) ( to ( ( get ( from ( one sequence ) ) ) ( to another ) ) ) ) ) ) ) ) . ) ) )
(ROOT (S (ADVP (RB Parsimony)) (NP (DT The) (NNP PARSIMONY) (NNS programs)) (VP (VBP make) (NP (DT the) (NN assumption)) (SBAR (IN that) (S (NP (DT the) (VBN desired) (NN tree)) (VP (VBZ is) (NP (NP (DT the) (NN one)) (PP (IN with) (NP (NP (DT the) (JJ fewest) (NNS changes)) (PP (IN in) (NP (PRP it))))) (S (VP (TO to) (VP (VB get) (PP (IN from) (NP (CD one) (NN sequence))) (PP (TO to) (NP (DT another))))))))))) (. .)))
Parsimony The PARSIMONY programs make the assumption that the desired tree is the one with the fewest changes in it to get from one sequence to another.
(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))))))))) (. .)))