Package net.didion.jwnl.data.relationship

Examples of net.didion.jwnl.data.relationship.RelationshipList

90
91
92
93
94
95
96
97
98
99
100
101
102
    hyponyms.print();
  }

  private void demonstrateAsymmetricRelationshipOperation(IndexWord start, IndexWord end) throws JWNLException {
    // Try to find a relationship between the first sense of <var>start</var> and the first sense of <var>end</var>
    RelationshipList list = RelationshipFinder.getInstance().findRelationships(start.getSense(1), end.getSense(1), PointerType.HYPERNYM);
    System.out.println("Hypernym relationship between \"" + start.getLemma() + "\" and \"" + end.getLemma() + "\":");
    for (Iterator itr = list.iterator(); itr.hasNext();) {
      ((Relationship) itr.next()).getNodeList().print();
    }
    System.out.println("Common Parent Index: " + ((AsymmetricRelationship) list.get(0)).getCommonParentIndex());
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }

  private void demonstrateSymmetricRelationshipOperation(IndexWord start, IndexWord end) throws JWNLException {
    // find all synonyms that <var>start</var> and <var>end</var> have in common
    RelationshipList list = RelationshipFinder.getInstance().findRelationships(start.getSense(1), end.getSense(1), PointerType.SIMILAR_TO);
    System.out.println("Synonym relationship between \"" + start.getLemma() + "\" and \"" + end.getLemma() + "\":");
    for (Iterator itr = list.iterator(); itr.hasNext();) {
      ((Relationship) itr.next()).getNodeList().print();
    }
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
    hyponyms.print();
  }

  private void demonstrateAsymmetricRelationshipOperation(IndexWord start, IndexWord end) throws JWNLException {
    // Try to find a relationship between the first sense of <var>start</var> and the first sense of <var>end</var>
    RelationshipList list = RelationshipFinder.getInstance().findRelationships(start.getSense(1), end.getSense(1), PointerType.HYPERNYM);
    System.out.println("Hypernym relationship between \"" + start.getLemma() + "\" and \"" + end.getLemma() + "\":");
    for (Iterator itr = list.iterator(); itr.hasNext();) {
      ((Relationship) itr.next()).getNodeList().print();
    }
    System.out.println("Common Parent Index: " + ((AsymmetricRelationship) list.get(0)).getCommonParentIndex());
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }

  private void demonstrateSymmetricRelationshipOperation(IndexWord start, IndexWord end) throws JWNLException {
    // find all synonyms that <var>start</var> and <var>end</var> have in common
    RelationshipList list = RelationshipFinder.getInstance().findRelationships(start.getSense(1), end.getSense(1), PointerType.SIMILAR_TO);
    System.out.println("Synonym relationship between \"" + start.getLemma() + "\" and \"" + end.getLemma() + "\":");
    for (Iterator itr = list.iterator(); itr.hasNext();) {
      ((Relationship) itr.next()).getNodeList().print();
    }
    System.out.println("Depth: " + ((Relationship) list.get(0)).getDepth());
  }
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
        return Integer.MAX_VALUE;

      Synset startSynset = start.getSense(1);
      Synset endSynset = end.getSense(1);

      RelationshipList list = RelationshipFinder.getInstance()
          .findRelationships(startSynset, endSynset, type);
      // System.out.println("Synonym relationship between \"" +
      // start.getLemma() + "\" and \"" + end.getLemma() + "\":");
      // for (Iterator itr = list.iterator(); itr.hasNext();)
      // ((Relationship) itr.next()).getNodeList().print();

      // if(!list.isEmpty())
      // System.out.println("Depth: " + ((Relationship)
      // list.get(0)).getDepth());
      int res = list.size();
      if (res > 0)
        return list.size();
      else
        return Integer.MAX_VALUE;
    } catch (Exception e) {
      org.apache.commons.logging.LogFactory.getLog(WordNetBridge.class)
          .error(e);
View Full Code Here
TOP

Related Classes of net.didion.jwnl.data.relationship.RelationshipList

  • cc.mallet.util.resources.wn.Examples
  • jcolibri.extensions.textual.wordnet.WordNetBridge
  • net.didion.jwnl.utilities.Examples
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.