List of usage examples for edu.stanford.nlp.trees TreePrint TreePrint
public TreePrint(String formats)
From source file:Anaphora_Resolution.ParseAllXMLDocuments.java
public static void main(String[] args) throws IOException, SAXException, ParserConfigurationException, TransformerException { // File dataFolder = new File("DataToPort"); // File[] documents; String grammar = "grammar/englishPCFG.ser.gz"; String[] options = { "-maxLength", "100", "-retainTmpSubcategories" }; //LexicalizedParser lp = new LexicalizedParser(grammar, options); LexicalizedParser lp = LexicalizedParser.loadModel("edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"); ///*from ww w . j a va 2 s . c o m*/ // if (dataFolder.isDirectory()) { // documents = dataFolder.listFiles(); // } else { // documents = new File[] {dataFolder}; // } // int currfile = 0; // int totfiles = documents.length; // for (File paper : documents) { // currfile++; // if (paper.getName().equals(".DS_Store")||paper.getName().equals(".xml")) { // currfile--; // totfiles--; // continue; // } // System.out.println("Working on "+paper.getName()+" (file "+currfile+" out of "+totfiles+")."); // // DocumentBuilderFactory docFactory = DocumentBuilderFactory.newInstance(); // This is for XML // DocumentBuilder docBuilder = docFactory.newDocumentBuilder(); // Document doc = docBuilder.parse(paper.getAbsolutePath()); // // NodeList textlist = doc.getElementsByTagName("text"); // for(int i=0; i < textlist.getLength(); i++) { // Node currentnode = textlist.item(i); // String wholetext = textlist.item(i).getTextContent(); String wholetext = "How about other changes for example the ways of doing the work and \n" + "\n" + "Iwould say security has , there 's more pressure put on people now than there used to be because obviously , especially after Locherbie , they tightened up on security and there 's a lot more pressure now especially from the ETR and stuff like that \n" + "People do n't feel valued any more , they feel I do n't know I think they feel that nobody cares about them really anyway \n"; //System.out.println(wholetext); //Iterable<List<? extends HasWord>> sentences; ArrayList<Tree> parseTrees = new ArrayList<Tree>(); String asd = ""; int j = 0; StringReader stringreader = new StringReader(wholetext); DocumentPreprocessor dp = new DocumentPreprocessor(stringreader); @SuppressWarnings("rawtypes") ArrayList<List> sentences = preprocess(dp); for (List sentence : sentences) { parseTrees.add(lp.apply(sentence)); // Parsing a new sentence and adding it to the parsed tree ArrayList<Tree> PronounsList = findPronouns(parseTrees.get(j)); // Locating all pronouns to resolve in the sentence Tree corefedTree; for (Tree pronounTree : PronounsList) { parseTrees.set(parseTrees.size() - 1, HobbsResolve(pronounTree, parseTrees)); // Resolving the coref and modifying the tree for each pronoun } StringWriter strwr = new StringWriter(); PrintWriter prwr = new PrintWriter(strwr); TreePrint tp = new TreePrint("penn"); tp.printTree(parseTrees.get(j), prwr); prwr.flush(); asd += strwr.toString(); j++; } String armando = ""; for (Tree sentence : parseTrees) { for (Tree leaf : Trees.leaves(sentence)) armando += leaf + " "; } System.out.println(wholetext); System.out.println(); System.out.println("......"); System.out.println(armando); System.out.println("All done."); // currentnode.setTextContent(asd); // } // TransformerFactory transformerFactory = TransformerFactory.newInstance(); // Transformer transformer = transformerFactory.newTransformer(); // DOMSource source = new DOMSource(doc); // StreamResult result = new StreamResult(paper); // transformer.transform(source, result); // // System.out.println("Done"); // } }
From source file:DependencyParser.Parser.java
public void CallParser(String text) // start of the main method { try {/* w w w.j av a 2 s . c o m*/ TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); LexicalizedParser lp = LexicalizedParser .loadModel("edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"); lp.setOptionFlags(new String[] { "-maxLength", "500", "-retainTmpSubcategories" }); TokenizerFactory<CoreLabel> tokenizerFactory = PTBTokenizer.factory(new CoreLabelTokenFactory(), ""); List<CoreLabel> wordList = tokenizerFactory.getTokenizer(new StringReader(text)).tokenize(); Tree tree = lp.apply(wordList); GrammaticalStructure gs = gsf.newGrammaticalStructure(tree); Collection<TypedDependency> tdl = gs.typedDependenciesCCprocessed(true); System.out.println(tdl); PrintWriter pw = new PrintWriter("H:\\Thesis Development\\Thesis\\NLP\\src\\nlp\\Text-Parsed.txt"); TreePrint tp = new TreePrint("penn,typedDependenciesCollapsed"); tp.printTree(tree, pw); pw.close(); Main.writeImage(tree, tdl, "H:\\Thesis Development\\Thesis\\NLP\\src\\nlp\\image.png", 3); assert (new File("image.png").exists()); } catch (FileNotFoundException f) { } catch (Exception ex) { Logger.getLogger(Parser.class.getName()).log(Level.SEVERE, null, ex); } }
From source file:DependencyParser.RunStanfordParser.java
public RunStanfordParser(String filename) throws FileNotFoundException, IOException { // input format: data directory, and output directory String fileToParse = filename; LexicalizedParser lp = LexicalizedParser.loadModel("edu/stanford/nlp/models/lexparser/englishPCFG.ser.gz"); //lp.setOptionFlags(new String[]{"-maxLength", "80", "-retainTmpSubcategories"}); // set max sentence length if you want // Call parser on files, and tokenize the contents FileInputStream fstream = new FileInputStream(fileToParse); DataInputStream in = new DataInputStream(fstream); // Get the object of DataInputStream BufferedReader br = new BufferedReader(new InputStreamReader(in)); StringReader sr; // we need to re-read each line into its own reader because the tokenizer is over-complicated garbage PTBTokenizer tkzr; // tokenizer object WordStemmer ls = new WordStemmer(); // stemmer/lemmatizer object // Read File Line By Line String strLine;/*from w w w . jav a 2 s . co m*/ while ((strLine = br.readLine()) != null) { System.out.println("Tokenizing and Parsing: " + strLine); // print current line to console // do all the standard java over-complication to use the stanford parser tokenizer sr = new StringReader(strLine); tkzr = PTBTokenizer.newPTBTokenizer(sr); List toks = tkzr.tokenize(); System.out.println("tokens: " + toks); Tree parse = (Tree) lp.apply(toks); // finally, we actually get to parse something // Output Option 1: Printing out various data by accessing it programmatically // Get words, stemmed words and POS tags ArrayList<String> words = new ArrayList(); ArrayList<String> stems = new ArrayList(); ArrayList<String> tags = new ArrayList(); // Get words and Tags ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { if (tw.tag().startsWith("N") || tw.tag().startsWith("J")) { words.add(tw.word()); tags.add(tw.tag()); } } System.out.println("Noun and Ajective words: " + words); System.out.println("POStags: " + tags); // Get stems ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { stems.add(tw.word()); } // Get dependency tree TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); Collection tdl = gs.typedDependenciesCollapsed(); // And print! System.out.println("words: " + words); System.out.println("POStags: " + tags); System.out.println("stemmedWordsAndTags: " + stems); System.out.println("typedDependencies: " + tdl); // getAspect_OpinionWord(tdl.toString(),words,tags); TreePrint tp = new TreePrint("words,penn"); //TreePrint tn = new TreePrint("words,typedDependenciesCollapsed"); //TreePrint to = new TreePrint("rootLabelOnlyFormat,penn"); //System.out.println("Tree print"+tp.); tp.printTree(parse); //tn.printTree(parse); System.out.println("Noun Phrases are: -------"); //(NP (DT a) (JJ temporary) (NN searcher)) String reg = "(\\(DT \\w*\\) \\((NN||NNS||NNP) \\w*\\)) | (\\(DT \\w*\\) \\((JJ||JJR||JJS) \\w*\\) \\((NN||NNS||NNP) \\w*\\)) | (\\((NN||NNS||NNP) \\w*\\) \\((NN||NNS||NNP) \\w*\\)) | (\\(DT \\w*\\) \\((NN||NNS||NNP) \\w*\\) \\((NN||NNS||NNP) \\w*\\))"; Pattern patt = Pattern.compile(reg); System.out.println(" Noun Phrase List:.."); dfs(parse, parse, patt); //for (Tree subtree: parse) //{ /* if(subtree.label().value().equals("NP")) { String a=subtree.toString(); //System.out.println(a); Matcher match = patt.matcher(a.trim()); while(match.find()) { System.out.println("NP: "+match.group()); } }*/ /*for(Tree np:subtree) { if(np.label().value().equals("NP")) { for(Tree n:np) { if(np.label().value().equals("\\(DT \\w*\\) \\((NN||NNS||NNP) \\w*\\)")) { System.out.println("NP tag Tags: "+np); System.out.println(Sentence.listToString(np.yield())); } else if(np.label().value().equals("\\((NN||NNS||NNP) \\w*\\) \\((NN||NNS||NNP) \\w*\\)")) { System.out.println("NP tag Tags: "+np); System.out.println(Sentence.listToString(np.yield())); } else if(np.label().value().equals("\\(DT \\w*\\) \\((NN||NNS||NNP) \\w*\\) \\((NN||NNS||NNP) \\w*\\)")) { System.out.println("NP tag Tags: "+np); System.out.println(Sentence.listToString(np.yield())); } else{ if(n.label().value().equals("NP")) { System.out.println("N tag Tags: "+n); System.out.println(Sentence.listToString(n.yield())); } } } } }*/ //} //} System.out.println(); // separate output lines*/ } }
From source file:edu.cmu.cs.in.hoop.visualizers.HoopParseTreeViewer.java
License:Open Source License
/** * /*from ww w . j a v a2 s. com*/ */ private void processInput(String aSentence) { debug("processInput (" + aSentence + ")"); Tree thisTree = theLexicalizedParser.apply(aSentence); debug("We have a tree!"); PrintWriter pw = new PrintWriter(System.out, true); TreePrint posPrinter = new TreePrint("wordsAndTags"); posPrinter.printTree(thisTree, pw); ArrayList ar = thisTree.taggedYield(); debug(ar.toString()); for (Tree subtree : thisTree) { if (thisTree.isLeaf() == true) { debug("Tree leaf: " + subtree.label().value()); } else { debug("Tree node: " + subtree.label().value()); } } treePanel.setTree(thisTree); }
From source file:englishparser.EnglishParser.java
/** * demoAPI demonstrates other ways of calling the parser with already * tokenized text, or in some cases, raw text that needs to be tokenized as * a single sentence. Output is handled with a TreePrint object. Note that * the options used when creating the TreePrint can determine what results * to print out. Once again, one can capture the output by passing a * PrintWriter to TreePrint.printTree.// w ww . j a v a 2 s. c om */ public static void demoAPI(LexicalizedParser lp) { // This option shows parsing a list of correctly tokenized words String[] sent = { "This", "is", "an", "easy", "sentence", "." }; List<CoreLabel> rawWords = Sentence.toCoreLabelList(sent); Tree parse = lp.apply(rawWords); parse.pennPrint(); System.out.println(); // This option shows loading and using an explicit tokenizer String sent2 = "This is another sentence."; TokenizerFactory<CoreLabel> tokenizerFactory = PTBTokenizer.factory(new CoreLabelTokenFactory(), ""); Tokenizer<CoreLabel> tok = tokenizerFactory.getTokenizer(new StringReader(sent2)); List<CoreLabel> rawWords2 = tok.tokenize(); parse = lp.apply(rawWords2); TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); List<TypedDependency> tdl = gs.typedDependenciesCCprocessed(); System.out.println(tdl); System.out.println(); // You can also use a TreePrint object to print trees and dependencies TreePrint tp = new TreePrint("penn,typedDependenciesCollapsed"); tp.printTree(parse); }
From source file:nlpOperations.RunStanfordParser.java
public static String tagOperations(String sent) { String resultStr = ""; StringReader sr;// w ww . j a v a2 s. c o m PTBTokenizer tkzr; WordStemmer ls = new WordStemmer(); // do all the standard java over-complication to use the stanford parser tokenizer sr = new StringReader(sent); tkzr = PTBTokenizer.newPTBTokenizer(sr); List toks = tkzr.tokenize(); System.out.println("tokens: " + toks); resultStr += "tokens: " + toks + "\n\n"; Tree parse = (Tree) lp.apply(toks); // finally, we actually get to parse something // Get words, stemmed words and POS tags ArrayList<String> words = new ArrayList(); ArrayList<String> stems = new ArrayList(); ArrayList<String> tags = new ArrayList(); // Get words and Tags for (TaggedWord tw : parse.taggedYield()) { words.add(tw.word()); tags.add(tw.tag()); } // Get stems ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { stems.add(tw.word()); } // Get dependency tree TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); Collection tdl = gs.typedDependenciesCollapsed(); // And print! System.out.println("words: " + words); System.out.println("POStags: " + tags); System.out.println("stemmedWords: " + stems); System.out.println("typedDependencies: " + tdl); resultStr += "words: " + words + "\n\n"; resultStr += "POStags: " + tags + "\n\n"; resultStr += "stemmedWords: " + stems + "\n\n"; resultStr += "typedDependencies: " + tdl + "\n\n"; TreePrint tp1 = new TreePrint("wordsAndTags,latexTree"); tp1.printTree(parse); System.out.println(); // separate output lines return resultStr; }
From source file:nlpOperations.RunStanfordParser.java
public static Vector taggingStemming(String sent) { Vector resVector = new Vector(); String resultStr = ""; StringReader sr;//from ww w .jav a 2 s. c o m PTBTokenizer tkzr; WordStemmer ls = new WordStemmer(); // do all the standard java over-complication to use the stanford parser tokenizer sr = new StringReader(sent); tkzr = PTBTokenizer.newPTBTokenizer(sr); List toks = tkzr.tokenize(); System.out.println("tokens: " + toks); resultStr += "tokens: " + toks + "\n\n"; Tree parse = (Tree) lp.apply(toks); // finally, we actually get to parse something // Get words, stemmed words and POS tags ArrayList<String> words = new ArrayList(); ArrayList<String> stems = new ArrayList(); ArrayList<String> tags = new ArrayList(); // Get words and Tags for (TaggedWord tw : parse.taggedYield()) { words.add(tw.word()); tags.add(tw.tag()); } // Get stems ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { stems.add(tw.word()); } for (int i = 0; i < toks.size(); i++) { ExpandedTerm expandedTerm = new ExpandedTerm(); expandedTerm.setTermOriginWord(toks.get(i).toString()); expandedTerm.setTermStemmedWord(stems.get(i)); expandedTerm.setTermTag(tags.get(i)); expandedTerm.setIsStopWord(StopWordList.isStopWord(stems.get(i))); resVector.add(expandedTerm); } // Get dependency tree TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); Collection tdl = gs.typedDependenciesCollapsed(); // And print! System.out.println("words: " + words); System.out.println("POStags: " + tags); System.out.println("stemmedWords: " + stems); System.out.println("typedDependencies: " + tdl); resultStr += "words: " + words + "\n\n"; resultStr += "POStags: " + tags + "\n\n"; resultStr += "stemmedWordsAndTags: " + stems + "\n\n"; resultStr += "typedDependencies: " + tdl + "\n\n"; TreePrint tp1 = new TreePrint("wordsAndTags,latexTree"); tp1.printTree(parse); System.out.println(); // separate output lines return resVector; }
From source file:nlpOperations.RunStanfordParser.java
public static void main(String[] args) throws Exception { String fileToParse = "E:\\OWL\\test.txt"; String englishDataUrl = "E:\\phd-project-tools\\q-system\\stanford-parser-full-2014-06-16\\stanford-parser-full-2014-06-16\\englishPCFG.ser.gz"; LexicalizedParser lp = LexicalizedParser.loadModel(englishDataUrl, "-maxLength", "80", "-retainTmpSubcategories"); // Call parser on files, and tokenize the contents FileInputStream fstream = new FileInputStream(fileToParse); DataInputStream in = new DataInputStream(fstream); // Get the object of DataInputStream BufferedReader br = new BufferedReader(new InputStreamReader(in)); StringReader sr; // we need to re-read each line into its own reader because the tokenizer is over-complicated garbage PTBTokenizer tkzr; // tokenizer object WordStemmer ls = new WordStemmer(); // stemmer/lemmatizer object // Read File Line By Line String strLine;//from w w w .ja va 2 s . com while ((strLine = br.readLine()) != null) { System.out.println("Tokenizing and Parsing: " + strLine); // print current line to console // do all the standard java over-complication to use the stanford parser tokenizer sr = new StringReader(strLine); tkzr = PTBTokenizer.newPTBTokenizer(sr); List toks = tkzr.tokenize(); System.out.println("tokens: " + toks); Tree parse = (Tree) lp.apply(toks); // finally, we actually get to parse something // Output Option 1: Printing out various data by accessing it programmatically // Get words, stemmed words and POS tags ArrayList<String> words = new ArrayList(); ArrayList<String> stems = new ArrayList(); ArrayList<String> tags = new ArrayList(); // Get words and Tags for (TaggedWord tw : parse.taggedYield()) { words.add(tw.word()); tags.add(tw.tag()); } // Get stems ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { stems.add(tw.word()); } // Get dependency tree TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); Collection tdl = gs.typedDependenciesCollapsed(); // And print! System.out.println("words: " + words); System.out.println("POStags: " + tags); System.out.println("stemmedWordsAndTags: " + stems); System.out.println("typedDependencies: " + tdl); // Output Option 2: Printing out various data using TreePrint // Various TreePrint options // "penn", // constituency parse // "oneline", // rootLabelOnlyFormat, // "words", // "wordsAndTags", // unstemmed words and pos tags // "dependencies", // unlabeled dependency parse // "typedDependencies", // dependency parse // "typedDependenciesCollapsed", // "latexTree", // "collocations", // "semanticGraph" // Print using TreePrint with various options // TreePrint tp = new TreePrint("wordsAndTags,semanticGraph"); // tp.printTree(parse); // System.out.println(); // separate output lines TreePrint tp1 = new TreePrint("wordsAndTags,latexTree"); tp1.printTree(parse); System.out.println(); // separate output lines // TreePrint tp2 = new TreePrint("wordsAndTags,collocations"); // tp2.printTree(parse); // System.out.println(); // separate output lines // // TreePrint tp3 = new TreePrint("wordsAndTags,dependencies"); // tp3.printTree(parse); // System.out.println(); // separate output lines } }
From source file:nlpOperations.RunStanfordParser.java
public static String getPhrases(String sent) { StringReader sr;// w w w . j a v a 2 s . c o m PTBTokenizer tkzr; WordStemmer ls = new WordStemmer(); // do all the standard java over-complication to use the stanford parser tokenizer sr = new StringReader(sent); tkzr = PTBTokenizer.newPTBTokenizer(sr); List toks = tkzr.tokenize(); System.out.println("tokens: " + toks); Tree parse = (Tree) lp.apply(toks); // finally, we actually get to parse something // Get words, stemmed words and POS tags ArrayList<String> words = new ArrayList(); ArrayList<String> stems = new ArrayList(); ArrayList<String> tags = new ArrayList(); // Get words and Tags for (TaggedWord tw : parse.taggedYield()) { words.add(tw.word()); tags.add(tw.tag()); } // Get stems ls.visitTree(parse); // apply the stemmer to the tree for (TaggedWord tw : parse.taggedYield()) { stems.add(tw.word()); } // Get dependency tree TreebankLanguagePack tlp = new PennTreebankLanguagePack(); GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); Collection tdl = gs.typedDependenciesCollapsed(); // And print! System.out.println("words: " + words); System.out.println("POStags: " + tags); System.out.println("stemmedWordsAndTags: " + stems); System.out.println("typedDependencies: " + tdl); /* dependecy mainpulation */ // remove [ ] //tokenization Object[] wordRelationsArr = tdl.toArray(); //get nn,amod relations String requiredRelations = ""; for (int i = 0; i < wordRelationsArr.length; i++) { String oneRelation = wordRelationsArr[i].toString(); if (oneRelation.trim().startsWith("nn") || (oneRelation.trim().startsWith("amod"))) { requiredRelations += oneRelation + "#"; } } String phrases = ""; //get nn words String[] requiredRelationsArr = requiredRelations.split("#"); for (int i = 0; i < requiredRelationsArr.length; i++) { String oneRelation = requiredRelationsArr[i]; if (oneRelation.trim().startsWith("nn")) { oneRelation = oneRelation.replace("(", ""); oneRelation = oneRelation.replace(")", ""); oneRelation = oneRelation.replace("nn", ""); String[] oneRelationArr = oneRelation.split(","); String w1 = oneRelationArr[0].split("-")[0]; String w2 = oneRelationArr[1].split("-")[0]; int phraseIndex = sent.indexOf(w2.trim() + " " + w1.trim()); phrases += w2.trim() + " " + w1.trim() + ":" + phraseIndex + "#"; } } //get amod words String[] requiredRelationsArr2 = requiredRelations.split("#"); for (int i = 0; i < requiredRelationsArr2.length; i++) { String oneRelation = requiredRelationsArr2[i]; if (oneRelation.trim().startsWith("amod")) { oneRelation = oneRelation.replace("(", ""); oneRelation = oneRelation.replace(")", ""); oneRelation = oneRelation.replace("amod", ""); String[] oneRelationArr = oneRelation.split(","); String w1 = oneRelationArr[0].split("-")[0]; String w2 = oneRelationArr[1].split("-")[0]; int phraseIndex = sent.indexOf(w2.trim() + " " + w1.trim()); phrases += w2.trim() + " " + w1.trim() + ":" + phraseIndex + "#"; } } System.out.println("phrases are " + phrases); TreePrint tp1 = new TreePrint("wordsAndTags,latexTree"); tp1.printTree(parse); System.out.println(); // separate output lines return phrases; }
From source file:percobaan.ParserDemo.java
/** * demoAPI demonstrates other ways of calling the parser with * already tokenized text, or in some cases, raw text that needs to * be tokenized as a single sentence. Output is handled with a * TreePrint object. Note that the options used when creating the * TreePrint can determine what results to print out. Once again, * one can capture the output by passing a PrintWriter to * TreePrint.printTree. This code is for English. *//*from w w w.j ava 2 s. co m*/ // public static void demoAPI(LexicalizedParser lp) { public void demoAPI(LexicalizedParser lp) { // This option shows parsing a list of correctly tokenized words String[] sent = { "This", "is", "an", "easy", "sentence", "." }; List<CoreLabel> rawWords = Sentence.toCoreLabelList(sent); Tree parse = lp.apply(rawWords); // parse.pennPrint(); // System.out.println(); // This option shows loading and using an explicit tokenizer // String sent2 = "Works great. Instructions were straightforward and easy to follow. Buying a second one just in case I need it in the future."; // for (int i = 0; i < data.lemmaKumpulans.size(); i++){ for (int i = 0; i < data.lemmaKumpulans.size(); i++) { String sent2 = data.lemmaKumpulans.get(i); TokenizerFactory<CoreLabel> tokenizerFactory = PTBTokenizer.factory(new CoreLabelTokenFactory(), ""); Tokenizer<CoreLabel> tok = tokenizerFactory.getTokenizer(new StringReader(sent2)); List<CoreLabel> rawWords2 = tok.tokenize(); parse = lp.apply(rawWords2); TreebankLanguagePack tlp = lp.treebankLanguagePack(); // PennTreebankLanguagePack for English GrammaticalStructureFactory gsf = tlp.grammaticalStructureFactory(); GrammaticalStructure gs = gsf.newGrammaticalStructure(parse); List<TypedDependency> tdl = gs.typedDependenciesCCprocessed(); // System.out.println(tdl); // System.out.println(); // You can also use a TreePrint object to print trees and dependencies TreePrint tp = new TreePrint("typedDependenciesCollapsed"); System.out.println(i + 1); tp.printTree(parse); //mengoutputkan hasil parsing } }