public static <K> Set<K> newIdentityHashSet() { return Collections.newSetFromMap(Generics.<K, Boolean>newIdentityHashMap()); }
static IdentityHashMap<Tree, Tree> buildParentMap(Tree tree) { IdentityHashMap<Tree, Tree> map = Generics.newIdentityHashMap(); buildParentMapHelper(tree, null, map); return map; }
public IdentityHashMap<Tree, byte[]> convertToBytes(IdentityHashMap<Tree, List<Tree>> uncompressed) { IdentityHashMap<Tree, byte[]> compressed = Generics.newIdentityHashMap(); for (Map.Entry<Tree, List<Tree>> entry : uncompressed.entrySet()) { compressed.put(entry.getKey(), convertToBytes(entry.getValue())); } return compressed; }
public double score(Tree tree) { IdentityHashMap<Tree, SimpleMatrix> nodeVectors = Generics.newIdentityHashMap(); Tree transformedTree = transformer.transformTree(tree); if (op.trainOptions.useContextWords) { Trees.convertToCoreLabels(transformedTree); transformedTree.setSpans(); } double score = scorer.score(transformedTree, nodeVectors); deepTrees.add(new DeepTree(tree, nodeVectors, score)); return score; }
public double score(Tree tree) { double totalScore = 0.0; for (DVParserCostAndGradient scorer : scorers) { IdentityHashMap<Tree, SimpleMatrix> nodeVectors = Generics.newIdentityHashMap(); Tree transformedTree = transformer.transformTree(tree); if (op.trainOptions.useContextWords) { Trees.convertToCoreLabels(transformedTree); transformedTree.setSpans(); } double score = scorer.score(transformedTree, nodeVectors); totalScore += score; //totalScore = Math.max(totalScore, score); } return totalScore; } }
public static IdentityHashMap<Tree, List<Tree>> convertToTrees(Collection<Tree> keys, IdentityHashMap<Tree, byte[]> compressed, int numThreads) { IdentityHashMap<Tree, List<Tree>> uncompressed = Generics.newIdentityHashMap(); MulticoreWrapper<byte[], List<Tree>> wrapper = new MulticoreWrapper<>(numThreads, new DecompressionProcessor()); for (Tree tree : keys) { wrapper.put(compressed.get(tree)); } for (Tree tree : keys) { if (!wrapper.peek()) { wrapper.join(); } uncompressed.put(tree, wrapper.poll()); } return uncompressed; }
IdentityHashMap<Tree, byte[]> trainCompressedParses = Generics.newIdentityHashMap();
public static <K> Set<K> newIdentityHashSet() { return Collections.newSetFromMap(Generics.<K, Boolean>newIdentityHashMap()); }
public static <K> Set<K> newIdentityHashSet() { return Collections.newSetFromMap(Generics.<K, Boolean>newIdentityHashMap()); }
static IdentityHashMap<Tree, Tree> buildParentMap(Tree tree) { IdentityHashMap<Tree, Tree> map = Generics.newIdentityHashMap(); buildParentMapHelper(tree, null, map); return map; }
static IdentityHashMap<Tree, Tree> buildParentMap(Tree tree) { IdentityHashMap<Tree, Tree> map = Generics.newIdentityHashMap(); buildParentMapHelper(tree, null, map); return map; }
static IdentityHashMap<Tree, Tree> buildParentMap(Tree tree) { IdentityHashMap<Tree, Tree> map = Generics.newIdentityHashMap(); buildParentMapHelper(tree, null, map); return map; }
public IdentityHashMap<Tree, byte[]> convertToBytes(IdentityHashMap<Tree, List<Tree>> uncompressed) { IdentityHashMap<Tree, byte[]> compressed = Generics.newIdentityHashMap(); for (Map.Entry<Tree, List<Tree>> entry : uncompressed.entrySet()) { compressed.put(entry.getKey(), convertToBytes(entry.getValue())); } return compressed; }
public IdentityHashMap<Tree, byte[]> convertToBytes(IdentityHashMap<Tree, List<Tree>> uncompressed) { IdentityHashMap<Tree, byte[]> compressed = Generics.newIdentityHashMap(); for (Map.Entry<Tree, List<Tree>> entry : uncompressed.entrySet()) { compressed.put(entry.getKey(), convertToBytes(entry.getValue())); } return compressed; }
public IdentityHashMap<Tree, byte[]> convertToBytes(IdentityHashMap<Tree, List<Tree>> uncompressed) { IdentityHashMap<Tree, byte[]> compressed = Generics.newIdentityHashMap(); for (Map.Entry<Tree, List<Tree>> entry : uncompressed.entrySet()) { compressed.put(entry.getKey(), convertToBytes(entry.getValue())); } return compressed; }
public double score(Tree tree) { IdentityHashMap<Tree, SimpleMatrix> nodeVectors = Generics.newIdentityHashMap(); Tree transformedTree = transformer.transformTree(tree); if (op.trainOptions.useContextWords) { Trees.convertToCoreLabels(transformedTree); transformedTree.setSpans(); } double score = scorer.score(transformedTree, nodeVectors); deepTrees.add(new DeepTree(tree, nodeVectors, score)); return score; }
public double score(Tree tree) { IdentityHashMap<Tree, SimpleMatrix> nodeVectors = Generics.newIdentityHashMap(); Tree transformedTree = transformer.transformTree(tree); if (op.trainOptions.useContextWords) { Trees.convertToCoreLabels(transformedTree); transformedTree.setSpans(); } double score = scorer.score(transformedTree, nodeVectors); deepTrees.add(new DeepTree(tree, nodeVectors, score)); return score; }
public double score(Tree tree) { IdentityHashMap<Tree, SimpleMatrix> nodeVectors = Generics.newIdentityHashMap(); Tree transformedTree = transformer.transformTree(tree); if (op.trainOptions.useContextWords) { Trees.convertToCoreLabels(transformedTree); transformedTree.setSpans(); } double score = scorer.score(transformedTree, nodeVectors); deepTrees.add(new DeepTree(tree, nodeVectors, score)); return score; }
public static IdentityHashMap<Tree, List<Tree>> convertToTrees(Collection<Tree> keys, IdentityHashMap<Tree, byte[]> compressed, int numThreads) { IdentityHashMap<Tree, List<Tree>> uncompressed = Generics.newIdentityHashMap(); MulticoreWrapper<byte[], List<Tree>> wrapper = new MulticoreWrapper<>(numThreads, new DecompressionProcessor()); for (Tree tree : keys) { wrapper.put(compressed.get(tree)); } for (Tree tree : keys) { if (!wrapper.peek()) { wrapper.join(); } uncompressed.put(tree, wrapper.poll()); } return uncompressed; }
public static IdentityHashMap<Tree, List<Tree>> convertToTrees(Collection<Tree> keys, IdentityHashMap<Tree, byte[]> compressed, int numThreads) { IdentityHashMap<Tree, List<Tree>> uncompressed = Generics.newIdentityHashMap(); MulticoreWrapper<byte[], List<Tree>> wrapper = new MulticoreWrapper<>(numThreads, new DecompressionProcessor()); for (Tree tree : keys) { wrapper.put(compressed.get(tree)); } for (Tree tree : keys) { if (!wrapper.peek()) { wrapper.join(); } uncompressed.put(tree, wrapper.poll()); } return uncompressed; }