Package gannuWSD.graphs

Examples of gannuWSD.graphs.Graph


      {
        relevantSynsets.addAll(word.getSenses());
      }
      for(i=0;i<senses.size()&&(target.getPos().equals("N")||this.allPos);i++)
      {
        Graph g=this.graphs.loadGraph(senses.get(i), this.dict)
        g.prune(relations, depth);
        double w=0.0d;
        double m=0.0d;
        ArrayList<String> dwords=new ArrayList<String>();
        for(Sense s:relevantSynsets)
        {
          GraphNode gn=g.get(s, depth, relations);
          if(gn!=null)
          {
            dwords.add(s.getSynonyms().get(0));
            m+=1.0d;
          }              
        }
        w=Math.pow(m, 0.1)*Math.pow(m/((double)g.getNodes().size()),Math.log(((double)i)+1.0d));
        decision.setSense(i, w, dwords);
      }
      decision.calculateAnswer();
      return decision;
    }
View Full Code Here


    rels.add("all");
    for(int i=0;i<target.getSenses().size();i++)
    {
      Sense sense=target.getSenses().get(i);
      ArrayList<String>dwords=new ArrayList<String>();
      Graph g=this.graphs.loadGraph(sense, dict);
      double w=0.0;
      for(AmbiguousWord word:window)
      {
        for(Sense s:word.getSenses())
        {
          GraphNode gn=g.get(s, deep, "all");
          if(gn!=null)
          {       
            dwords.add(word.getLemma());
            break;
          }
        }
      }
        w=g.getRootDegree(window,deep,rels);
      d.setSense(i, w, dwords);
    }
   
    d.calculateAnswer();
    return d;
View Full Code Here

TOP

Related Classes of gannuWSD.graphs.Graph

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.