Package org.fnlp.nlp.parser

Examples of org.fnlp.nlp.parser.Sentence

120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
    LabelAlphabet postagAlphabet = factory.buildLabelAlphabet("postag");

    int count = 0;
    while (reader.hasNext()) {

      Sentence instance = (Sentence) reader.next();
      int[] heads = (int[]) instance.getTarget();
      ParsingState state = new ParsingState(instance,factory);
      while (!state.isFinalState()) {
        // 左右焦点词在句子中的位置
        int[] lr = state.getFocusIndices();

        HashSparseVector features = state.getFeatures();
        ParsingState.Action action = getAction(lr[0], lr[1],
            heads);
        state.next(action);
        if (action == ParsingState.Action.LEFT)
          heads[lr[1]] = -1;
        if (action == ParsingState.Action.RIGHT)
          heads[lr[0]] = -1;

        // writer.write(String.valueOf(instance.postags[lr[0]]));
        String pos = instance.getTagAt(lr[0]);
        postagAlphabet.lookupIndex(pos);
        writer.write(pos);
        writer.write(" ");
        switch (action) {
        case LEFT:
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
    int count = 0;
   
    //preReader为了把ysize定下来
    la.lookupIndex("S");
    while(preReader.hasNext()){
      Sentence sent = (Sentence) preReader.next();
      Target targets = (Target)sent.getTarget();
      for(int i=0; i<sent.length(); i++){
        String label;
        if(targets.getHead(i) != -1){
          if(targets.getHead(i) < i){
            label = "L" + targets.getDepClass(i);
          }
          //else if(targets.getHead(i) > i){
          else{
            label = "R" + targets.getDepClass(i);
          }
          la.lookupIndex(label);
        }
      }
    }
    int ysize = la.size();
    la.setStopIncrement(true);
       
    while (reader.hasNext()) {
      Sentence sent = (Sentence) reader.next();
      //  int[] heads = (int[]) instance.getTarget();
      String depClass = null;
      Target targets = (Target)sent.getTarget();
      JointParsingState state = new JointParsingState(sent);
     
      while (!state.isFinalState()) {
        // 左右焦点词在句子中的位置
        int[] lr = state.getFocusIndices();

        ArrayList<String> features = state.getFeatures();
        JointParsingState.Action action = getAction(lr[0], lr[1],
            targets);
        switch (action) {
        case LEFT:
          depClass = targets.getDepClass(lr[1]);
          break;
        case RIGHT:
          depClass = targets.getDepClass(lr[0]);
          break;
        default:

        }
        state.next(action,depClass);
        if (action == JointParsingState.Action.LEFT)
          targets.setHeads(lr[1],-1);
        if (action == JointParsingState.Action.RIGHT)
          targets.setHeads(lr[0],-1);
        String label = "";
        switch (action) {
        case LEFT:
          label += "L"+sent.getDepClass(lr[1]);   
          break;
        case RIGHT:
          label+="R"+sent.getDepClass(lr[0]);
          break;
        default:
          label = "S";         
        }
        int id = la.lookupIndex(label);       
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
95
      writer = new BufferedWriter(new OutputStreamWriter(
          new FileOutputStream(resultFile), charset));

    long beginTime = System.currentTimeMillis();
    while (reader.hasNext()) {
      Sentence instance = (Sentence) reader.next();
      // int[] golds = new int[instance.length()];
      int[] heads = (int[]) instance.getTarget();
      // System.arraycopy(heads, 0, golds, 0, golds.length);
      // instance.setSource(heads);

      Predict<int[]> pred = parser.getBest(instance);
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
    long beginTime = System.currentTimeMillis();
    int count = 0;
    while (reader.hasNext()) {
//      System.out.println(count++);
      Sentence instance = (Sentence) reader.next();
     
      Target targets = (Target) instance.getTarget();

      int[] heads = targets.getHeads();     
      String[] depClass = targets.getRelations();
      Target t = parser.parse2R(instance);     
      String[] dPreds = (String[]) t.getRelations();
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
    IFeatureAlphabet features = factory.DefaultFeatureAlphabet();
    features.setStopIncrement(true);
  }

  public Predict<int[]> getBest(Instance inst) {
    Sentence sent = (Sentence) inst;

    Predict<DependencyTree> res = _getBestParse(sent);
    float score = res.getScore(0);
    DependencyTree dt = res.getLabel(0);
   
    Predict<int[]> ret = new Predict<int[]>();
    int[] preds = new int[sent.length()];
    Arrays.fill(preds, -1);
    DependencyTree.toArrays(dt, preds);
    ret.add(preds,score);
    return ret;
  }
View Full Code Here
237
238
239
240
241
242
243
//  public int[] parse(String[][] strings) {
//    return parse(new Sentence(strings));
//  }
 
  public int[] parse(String[] words, String[] pos)  {
    return parse(new Sentence(words, pos));
  }
View Full Code Here
249
250
251
252
253
254
255
  public DependencyTree getBestParse(String[] words)  {
    return getBestParse(words, null);
  }
 
  public DependencyTree getBestParse(String[] words, String[] tags)  {
    return getBestParse(new Sentence(words, tags));
  }
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
    return result;
  }

  public Target jointParse(Instance inst)  {
    Sentence sent = (Sentence) inst;

    Predict<DependencyTree> res = _getBestParse(sent);
    DependencyTree dt = res.getLabel(0);

    Target target = new Target(sent.length());

    target=target.ValueOf(dt);

    return target;
  }
View Full Code Here
196
197
198
199
200
201
202
//  public int[] parse(String[][] strings) {
//    return parse(new Sentence(strings));
//  }

  public int[] parse(String[] words, String[] pos)  {
    return parse(new Sentence(words, pos));
  }
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
  public int[] parse(String[] words, String[] pos)  {
    return parse(new Sentence(words, pos));
  }
 
  public Predict<int[]> getBest(Instance inst) {
    Sentence sent = (Sentence) inst;

    Predict<DependencyTree> res = _getBestParse(sent);
    float score = res.getScore(0);
    DependencyTree dt = res.getLabel(0);

    Predict<int[]> ret = new Predict<int[]>();
    int[] preds = new int[sent.length()];
    Arrays.fill(preds, -1);
    DependencyTree.toArrays(dt, preds);
    ret.add(preds,score);
    return ret;
  }
View Full Code Here
TOP

Related Classes of org.fnlp.nlp.parser.Sentence

  • org.fnlp.nlp.parser.dep.JointParser
  • org.fnlp.nlp.parser.dep.reader.CoNLLReader
  • org.fnlp.nlp.parser.dep.reader.FNLPReader
  • org.fnlp.nlp.parser.dep.reader.Malt2Reader
  • org.fnlp.nlp.parser.dep.reader.MaltReader
  • org.fnlp.nlp.parser.dep.train.JointParerTester
  • org.fnlp.nlp.parser.dep.train.JointParerTrainer
  • org.fnlp.nlp.parser.dep.train.ParserTester
  • org.fnlp.nlp.parser.dep.train.ParserTrainer
  • org.fnlp.nlp.parser.dep.YamadaParser
    • 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.