All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.mayabot.nlp.segment.lexer.perceptron.PerceptronSegmentAlgorithm Maven / Gradle / Ivy

There is a newer version: 4.0.0
Show newest version
package com.mayabot.nlp.segment.lexer.perceptron;

import com.mayabot.nlp.segment.Nature;
import com.mayabot.nlp.segment.WordSplitAlgorithm;
import com.mayabot.nlp.segment.common.BaseSegmentComponent;
import com.mayabot.nlp.segment.lexer.core.CoreDictionaryImpl;
import com.mayabot.nlp.segment.wordnet.Vertex;
import com.mayabot.nlp.segment.wordnet.Wordnet;

import static com.mayabot.nlp.segment.lexer.perceptron.PerceptronSegment.E;
import static com.mayabot.nlp.segment.lexer.perceptron.PerceptronSegment.S;

/**
 * 基于核心词典的基础切词器
 *
 * @author jimichan
 */
public class PerceptronSegmentAlgorithm extends BaseSegmentComponent implements WordSplitAlgorithm {

    private final PerceptronSegment perceptron;
    private PerceptronsSegmentService service;
    private CoreDictionaryImpl coreDictionary;

    public PerceptronSegmentAlgorithm(PerceptronsSegmentService service, CoreDictionaryImpl coreDictionary) {
        super(LEVEL1);
        this.service = service;
        this.coreDictionary = coreDictionary;
        perceptron = service.getPerceptron();
    }

    @Override
    public void fill(Wordnet wordnet) {
        char[] text = wordnet.getCharArray();

        int[] decode = perceptron.decode(text, false);

        int p = 0;
        for (int i = 0; i < decode.length; i++) {
            int x = decode[i];
            if (x == PerceptronSegment.S || x == PerceptronSegment.E) {
                combine(wordnet, text, p, i - p + 1);
                p = i + 1;
            }
        }

        if (p < text.length) {
            combine(wordnet, text, p, text.length - p);
        }
    }

    private void combine(Wordnet wordnet, char[] text, int offset, int length) {
        Vertex vertex = wordnet.put(offset, length);
        int wordId = coreDictionary.wordId(text, offset, length);
        if (wordId >= 0) {
            int freq = coreDictionary.wordFreq(wordId);
            vertex.wordID = wordId;
            vertex.freq = freq;
        } else {
            vertex.setAbsWordNatureAndFreq(Nature.newWord);
        }
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy