private Integer findMax() { Integer max = null; for (ExtendedNode tree : trees) { for (ExtendedNode node : AbstractNodeUtils.treeToSet(tree)) { Integer corefId = getCorefIdOfNode(node); if (corefId!=null) { if (null==max) max = corefId; else { if (max.intValue()<corefId.intValue()) { max = corefId; } } } } } return max; }
private void insertNodesToCoreferenceInformation() throws TreeCoreferenceInformationException { for (ExtendedNode tree : trees) { for (ExtendedNode node : AbstractNodeUtils.treeToSet(tree)) { Integer corefId = getCorefIdOfNode(node); if (corefId!=null) { coreferenceInformation.addNodeToGroup(corefId,node); } } } }
private void constructSetOfLemmas() throws TeEngineMlException { lemmas = new LinkedHashSet<LemmaAndPos>(); for (ExtendedNode node : AbstractNodeUtils.treeToSet(treeAndParentMap.getTree())) { if (InfoObservations.infoHasLemma(node.getInfo())) { String lemma = InfoGetFields.getLemma(node.getInfo()); PartOfSpeech pos = InfoGetFields.getPartOfSpeechObject(node.getInfo()); LemmaAndPos lemmaAndPos = new LemmaAndPos(lemma, pos); lemmas.add(lemmaAndPos); } } }
protected void findCoreferringNodes() throws TreeCoreferenceInformationException { mapNodeToCoreferringNodes = new SimpleValueSetMap<ExtendedNode, ExtendedNode>(); for (ExtendedNode node : AbstractNodeUtils.treeToSet(textTree.getTree())) { if (mapNodeToOriginal.containsKey(node)) { ExtendedNode itsOriginal = mapNodeToOriginal.get(node); if (coreferenceInformation.isNodeExist(itsOriginal)) { Integer originalNodeId = coreferenceInformation.getIdOf(itsOriginal); ImmutableSet<ExtendedNode> nodesInTheGroup = coreferenceInformation.getGroup(originalNodeId); if (nodesInTheGroup.size()>1) // this node is not alone { for (ExtendedNode coreferringNode : nodesInTheGroup) { if (coreferringNode!=itsOriginal) // we are looking for other nodes { mapNodeToCoreferringNodes.put(node, coreferringNode); } } } } } } }