boolean function ( List < ? extends HasWord > arg0 , PrintWriter arg1 ) { boolean loc0 = parse ( arg0 ) ; return loc0 ; }
todo : if we add anything interesting to report , we should report it here concode_field_sep List<? extends HasWord> originalSentence concode_elem_sep State initialState concode_elem_sep List<State> bestParses concode_elem_sep ShiftReduceParser parser concode_elem_sep boolean success concode_elem_sep boolean unparsable concode_elem_sep TregexPattern rearrangeFinalPunctuationTregex concode_elem_sep Debinarizer debinarizer concode_elem_sep TsurgeonPattern rearrangeFinalPunctuationTsurgeon concode_elem_sep State finalState concode_elem_sep Tree debinarized concode_elem_sep List<ParserConstraint> constraints concode_field_sep boolean parseInternal concode_elem_sep double getPCFGScore concode_elem_sep KBestViterbiParser getPCFGParser concode_elem_sep List<? extends HasWord> originalSentence concode_elem_sep void setConstraints concode_elem_sep boolean parseFallback concode_elem_sep boolean parseUnparsable concode_elem_sep boolean hasFactoredParse concode_elem_sep Tree getBestParse concode_elem_sep List<ScoredObject<Tree>> getKBestPCFGParses concode_elem_sep void restoreOriginalWords concode_elem_sep boolean parseSkipped concode_elem_sep Tree getBestFactoredParse concode_elem_sep List<ScoredObject<Tree>> getKGoodFactoredParses concode_elem_sep KBestViterbiParser getDependencyParser concode_elem_sep Tree getBestPCFGParse concode_elem_sep boolean parse concode_elem_sep boolean parse concode_elem_sep boolean saidMemMessage concode_elem_sep Tree getBestDependencyParse concode_elem_sep KBestViterbiParser getFactoredParser concode_elem_sep List<Transition> getBestTransitionSequence concode_elem_sep List<ScoredObject<Tree>> getBestPCFGParses concode_elem_sep boolean parseNoMemory concode_elem_sep Tree getBestBinarizedParse concode_elem_sep boolean parseSucceeded