static public DEPTree toDEPTree(List<String> tokens) { DEPTree tree = new DEPTree(); int i, size = tokens.size(); for (i=0; i<size; i++) tree.add(new DEPNode(i+1, tokens.get(i))); return tree; }
static public DEPTree toDEPTree(POSNode[] nodes) { DEPTree tree = new DEPTree(); int i, size = nodes.length; for (i=0; i<size; i++) tree.add(new DEPNode(i+1, nodes[i])); return tree; } }
/** Generates a question from a declarative sentence. */ public DEPTree generateQuestionFromDeclarative(DEPNode root, boolean convertUnI) { DEPTree tree = new DEPTree(); for (DEPNode node : root.getSubNodeSortedList()) tree.add(node); return generateQuestionFromDeclarative(tree, convertUnI); }
@Override public void process(JCas jCas) throws AnalysisEngineProcessException { for (Sentence sentence : JCasUtil.select(jCas, Sentence.class)) { List<BaseToken> tokens = JCasUtil.selectCovered(jCas, BaseToken.class, sentence); DEPTree tree = new DEPTree(); // Convert CAS data into structures usable by ClearNLP for (int i = 0; i < tokens.size(); i++) { BaseToken token = tokens.get(i); DEPNode node = new DEPNode(i+1, token.getCoveredText()); tree.add(node); } // Run parser and convert output back to CAS friendly data types postagger.process(tree); for (int i = 0; i < tokens.size(); i++) { BaseToken token = tokens.get(i); DEPNode node = tree.get(i+1); token.setPartOfSpeech(node.pos); } } } }
@Override public void process(JCas jCas) throws AnalysisEngineProcessException { for (Sentence sentence : JCasUtil.select(jCas, Sentence.class)) { List<BaseToken> tokens = JCasUtil.selectCovered(jCas, BaseToken.class, sentence); DEPTree tree = new DEPTree(); // Convert CAS data into structures usable by ClearNLP for (int i = 0; i < tokens.size(); i++) { BaseToken token = tokens.get(i); DEPNode node = new DEPNode(i+1, token.getCoveredText()); tree.add(node); } // Run parser and convert output back to CAS friendly data types postagger.process(tree); for (int i = 0; i < tokens.size(); i++) { BaseToken token = tokens.get(i); DEPNode node = tree.get(i+1); token.setPartOfSpeech(node.pos); } } } }
/** Called by {@link LGAsk#generateQuestionFromAsk(DEPTree, String)}. */ public DEPTree generateQuestion(DEPNode verb) { Set<DEPNode> added = new HashSet<DEPNode>(); DEPTree tree = new DEPTree(); DEPNode rel, aux; rel = setRelativizer(tree, verb, added); aux = setAuxiliary(tree, verb, added, rel); setRest(tree, verb, added); resetDEPTree(tree, verb); if (aux != null) matchNumber(verb, aux); return tree; }
DEPNode node; DEPTree tree = new DEPTree(); for (i=0; i<size; i++) tree.add(new DEPNode());
DEPNode node; DEPTree tree = new DEPTree();
@Override public synchronized void process( JCas jCas ) throws AnalysisEngineProcessException { LOGGER.info( "Dependency parser starting with thread:" + Thread.currentThread().getName() ); for ( Sentence sentence : JCasUtil.select( jCas, Sentence.class ) ) { List<BaseToken> printableTokens = new ArrayList<>(); for ( BaseToken token : JCasUtil.selectCovered( jCas, BaseToken.class, sentence ) ) { if ( token instanceof NewlineToken ) continue; printableTokens.add( token ); } if ( printableTokens.isEmpty() ) { // If there are no printable tokens then #convert fails continue; } DEPTree tree = new DEPTree(); // Convert CAS data into structures usable by ClearNLP for ( int i = 0; i < printableTokens.size(); i++ ) { BaseToken token = printableTokens.get( i ); String lemma = useLemmatizer ? lemmatizer.getLemma( token.getCoveredText(), token.getPartOfSpeech() ) : token.getNormalizedForm(); DEPNode node = new DEPNode( i + 1, token.getCoveredText(), lemma, token.getPartOfSpeech(), new DEPFeat() ); tree.add( node ); } // Run parser and convert output back to CAS friendly data types synchronized(LOCK){ parser.process( tree ); ArrayList<ConllDependencyNode> nodes = ClearDependencyUtility.convert( jCas, tree, sentence, printableTokens ); DependencyUtility.addToIndexes( jCas, nodes ); } } LOGGER.info( "Dependency parser ending with thread:" + Thread.currentThread().getName() ); }
static public void main(String[] args) { DEPReader fin = new DEPReader(0, 1, 2, 3, 4, 5, 6); DEPTree tree = new DEPTree(); fin.open(UTInput.createBufferedFileReader(args[0])); tree = fin.next(); CSenTypeClassifierEN sen = new CSenTypeClassifierEN(); tree.setDependents(); System.out.println(sen.isInterrogative(tree.get(1))); } }
@Override public void process(JCas jCas) throws AnalysisEngineProcessException { for (Sentence sentence : JCasUtil.select(jCas, Sentence.class)) { List<BaseToken> printableTokens = new ArrayList<>(); for(BaseToken token : JCasUtil.selectCovered(jCas, BaseToken.class, sentence)){ if(token instanceof NewlineToken) continue; printableTokens.add(token); } if ( printableTokens.isEmpty() ) { // If there are no printable tokens then #convert fails continue; } DEPTree tree = new DEPTree(); // Convert CAS data into structures usable by ClearNLP for (int i = 0; i < printableTokens.size(); i++) { BaseToken token = printableTokens.get(i); String lemma = useLemmatizer ? lemmatizer.getLemma(token.getCoveredText(), token.getPartOfSpeech()) : token.getNormalizedForm(); DEPNode node = new DEPNode(i+1, token.getCoveredText(), lemma, token.getPartOfSpeech(), new DEPFeat()); tree.add(node); } // Run parser and convert output back to CAS friendly data types parser.process(tree); ArrayList<ConllDependencyNode> nodes = ClearDependencyUtility.convert( jCas, tree, sentence, printableTokens ); DependencyUtility.addToIndexes( jCas, nodes ); } }
DEPTree tree = new DEPTree();
/** @return the dependency tree converted from the specific constituent tree without head information. */ protected DEPTree initDEPTree(CTTree cTree) { DEPTree dTree = new DEPTree(); String form, lemma, pos; DEPNode dNode; int id; for (CTNode node : cTree.getTokens()) { id = node.getTokenId() + 1; form = MPLib.revertBracket(node.form); lemma = AbstractColumnReader.BLANK_COLUMN; pos = node.pTag; dNode = new DEPNode(id, form, lemma, pos, node.c2d.d_feats); dTree.add(dNode); } dTree.initXHeads(); return dTree; }
DEPTree tree = new DEPTree();
DEPTree tree = new DEPTree(); DEPNode node; String[] tmp;
public DEPTree getNullTree() { DEPTree tree = new DEPTree(); DEPNode dummy = new DEPNode(1, "NULL", "NULL", "NULL", new DEPFeat()); dummy.setHead(tree.get(0), "NULL"); tree.add(dummy); tree.initXHeads(); tree.initSHeads(); return tree; }
private DEPTree getNullTree() { DEPTree tree = new DEPTree(); DEPNode dummy = new DEPNode(1, "NULL", "NULL", "NULL", new DEPFeat()); dummy.setHead(tree.get(0), "NULL"); tree.add(dummy); tree.initXHeads(); tree.initSHeads(); return tree; }
head = root.getDependents().get(0).getNode(); tree = new DEPTree(); head.removeDependentsByLabels(p);
public DEPTree getDEPTreeWithoutEdited(CTTree cTree, DEPTree dTree) { IntOpenHashSet set = new IntOpenHashSet(); addEditedTokensAux(cTree.getRoot(), set); int i, j, size = dTree.size(); DEPTree tree = new DEPTree(); DEPNode node; for (i=1,j=1; i<size; i++) { if (!set.contains(i)) { node = dTree.get(i); node.id = j++; removeEditedHeads(node.getXHeads(), set); removeEditedHeads(node.getSHeads(), set); tree.add(node); } } return (tree.size() == 1) ? null : tree; }
DEPTree tree = new DEPTree(); int i, size = size();