for (String lex : lexToTreeNode.keySet()) { for (int i=0;i<lexToTreeNode.size(lex) && i<lexToSemNode.size(lex);i++) { map.put(new PositionedTree(lexToTreeNode.get(lex, i).treeNode, tree), lexToSemNode.get(lex,i).node); int bestScore = 99999; for (Tree curr : nonTerm) { IndexedWord equivNode = map.get(new PositionedTree(curr, tree)); if ((equivNode == null) || !depthMap.containsKey(equivNode)) continue; int currScore = depthMap.get(equivNode); map.put(new PositionedTree(nonTerm, tree), bestNode);
for (String lex : lexToTreeNode.keySet()) { for (int i=0;i<lexToTreeNode.size(lex) && i<lexToSemNode.size(lex);i++) { map.put(new PositionedTree(lexToTreeNode.get(lex, i).treeNode, tree), lexToSemNode.get(lex,i).node); int bestScore = 99999; for (Tree curr : nonTerm) { IndexedWord equivNode = map.get(new PositionedTree(curr, tree)); if ((equivNode == null) || !depthMap.containsKey(equivNode)) continue; int currScore = depthMap.get(equivNode); map.put(new PositionedTree(nonTerm, tree), bestNode);
for (String lex : lexToTreeNode.keySet()) { for (int i=0;i<lexToTreeNode.size(lex) && i<lexToSemNode.size(lex);i++) { map.put(new PositionedTree(lexToTreeNode.get(lex, i).treeNode, tree), lexToSemNode.get(lex,i).node); int bestScore = 99999; for (Tree curr : nonTerm) { IndexedWord equivNode = map.get(new PositionedTree(curr, tree)); if ((equivNode == null) || !depthMap.containsKey(equivNode)) continue; int currScore = depthMap.get(equivNode); map.put(new PositionedTree(nonTerm, tree), bestNode);