コード例 #1
0
ファイル: Vector.java プロジェクト: carolinebarriere/ws4j
  protected Relatedness calcRelatedness(Concept synset1, Concept synset2) {
    if (synset1 == null || synset2 == null) return new Relatedness(min, null, illegalSynset);
    if (synset1.getSynset().equals(synset2.getSynset()))
      return new Relatedness(max, identicalSynset, null);

    return new Relatedness(0);
  }
コード例 #2
0
  @Override
  protected Relatedness calcRelatedness(Concept synset1, Concept synset2) {
    StringBuilder tracer = new StringBuilder();
    if (synset1 == null || synset2 == null) return new Relatedness(min, null, illegalSynset);
    // Don't short-circuit!
    // if ( synset1.getSynset().equals( synset2.getSynset() ) ) return new Relatedness( max );

    StringBuilder subTracer = enableTrace ? new StringBuilder() : null;
    List<Subsumer> lcsList = pathFinder.getLCSByPath(synset1, synset2, subTracer);
    if (lcsList.size() == 0) return new Relatedness(min);

    // TODO: investigate if these values are always valid for wn-jpn-0.9.0
    int maxDepth = 1;
    if (synset1.getPos().equals(POS.n)) {
      maxDepth = 20;
    } else if (synset1.getPos().equals(POS.v)) {
      maxDepth = 14;
    }

    // System.out.println(lcsList);
    int length = lcsList.get(0).length;

    //	 	int maxDepth = -1;
    //		for ( Depth lcs : lcsList ) {
    //
    //			List<String> roots = getTaxonomies( lcs );
    //			for ( String root : roots ) {
    //				int depth = getTaxonomyDepth( root );
    //				if ( depth > maxDepth ) maxDepth = depth;
    //			}
    //
    //		}

    double score = -Math.log((double) length / (double) (2 * maxDepth));

    if (enableTrace) {
      tracer.append(subTracer.toString());
      for (Subsumer lcs : lcsList) {
        tracer.append("Lowest Common Subsumer(s): ");
        tracer.append(
            db.conceptToString(lcs.subsumer.getSynset()) + " (Length=" + lcs.length + ")\n");
      }
    }

    return new Relatedness(score, tracer.toString(), null);
  }