Tabnine Logo
Word.<init>
Code IndexAdd Tabnine to your IDE (free)

How to use
com.chenlb.mmseg4j.Word
constructor

Best Java code snippets using com.chenlb.mmseg4j.Word.<init> (Showing top 18 results out of 315)

origin: medcl/elasticsearch-analysis-mmseg

private Word createWord(StringBuilder bufSentence, int startIdx, String type) {
  return new Word(toChars(bufSentence), startIdx, type);
}
 
origin: com.chenlb.mmseg4j/mmseg4j-core

private Word createWord(StringBuilder bufSentence, int startIdx, String type) {
  return new Word(toChars(bufSentence), startIdx, type);
}
 
origin: chenlb/mmseg4j-core

private Word createWord(StringBuilder bufSentence, int startIdx, String type) {
  return new Word(toChars(bufSentence), startIdx, type);
}
 
origin: medcl/elasticsearch-analysis-mmseg

private Word createWord(StringBuilder bufSentence, String type) {
  return new Word(toChars(bufSentence), startIdx(bufSentence), type);
}
 
origin: com.chenlb.mmseg4j/mmseg4j-core

private Word createWord(StringBuilder bufSentence, String type) {
  return new Word(toChars(bufSentence), startIdx(bufSentence), type);
}
 
origin: chenlb/mmseg4j-core

private Word createWord(StringBuilder bufSentence, String type) {
  return new Word(toChars(bufSentence), startIdx(bufSentence), type);
}
 
origin: chenlb/mmseg4j-core

int idx = search(chs, offset, 1);
if(idx > -1) {
  cks.add(new Word(chs, senStartOffset, offset, 2));
  end = offset+2;
  n++;
} else if(offset >= end) {	//有单字
  cks.add(new Word(chs, senStartOffset, offset, 1));
  end = offset+1;
cks.add(new Word(chs, senStartOffset, offset, 1));
origin: medcl/elasticsearch-analysis-mmseg

int idx = search(chs, offset, 1);
if(idx > -1) {
  cks.add(new Word(chs, senStartOffset, offset, 2));
  end = offset+2;
  n++;
} else if(offset >= end) {	//有单字
  cks.add(new Word(chs, senStartOffset, offset, 1));
  end = offset+1;
cks.add(new Word(chs, senStartOffset, offset, 1));
origin: com.chenlb.mmseg4j/mmseg4j-core

int idx = search(chs, offset, 1);
if(idx > -1) {
  cks.add(new Word(chs, senStartOffset, offset, 2));
  end = offset+2;
  n++;
} else if(offset >= end) {	//有单字
  cks.add(new Word(chs, senStartOffset, offset, 1));
  end = offset+1;
cks.add(new Word(chs, senStartOffset, offset, 1));
origin: medcl/elasticsearch-analysis-mmseg

private Chunk createChunk(Sentence sen, char[] chs, int[] tailLen, int[] offsets, CharNode[] cns/*, char[][] cks*/) {
  Chunk ck = new Chunk();
  
  for(int i=0; i<3; i++) {
    if(offsets[i] < chs.length) {
      ck.words[i] = new Word(chs, sen.getStartOffset(), offsets[i], tailLen[i]+1);//new Word(cks[i], sen.getStartOffset()+offsets[i]);
      if(tailLen[i] == 0) {	//单字的要取得"字频计算出自由度"
        CharNode cn = cns[i];    //dic.head(chs[offsets[i]]);
        if(cn !=null) {
          ck.words[i].setDegree(cn.getFreq());
        }
      }
    }
  }
  return ck;
}
 
origin: com.chenlb.mmseg4j/mmseg4j-core

private Chunk createChunk(Sentence sen, char[] chs, int[] tailLen, int[] offsets, CharNode[] cns/*, char[][] cks*/) {
  Chunk ck = new Chunk();
  
  for(int i=0; i<3; i++) {
    if(offsets[i] < chs.length) {
      ck.words[i] = new Word(chs, sen.getStartOffset(), offsets[i], tailLen[i]+1);//new Word(cks[i], sen.getStartOffset()+offsets[i]);
      if(tailLen[i] == 0) {	//单字的要取得"字频计算出自由度"
        CharNode cn = cns[i];    //dic.head(chs[offsets[i]]);
        if(cn !=null) {
          ck.words[i].setDegree(cn.getFreq());
        }
      }
    }
  }
  return ck;
}
 
origin: chenlb/mmseg4j-core

private Chunk createChunk(Sentence sen, char[] chs, int[] tailLen, int[] offsets, CharNode[] cns/*, char[][] cks*/) {
  Chunk ck = new Chunk();
  
  for(int i=0; i<3; i++) {
    if(offsets[i] < chs.length) {
      ck.words[i] = new Word(chs, sen.getStartOffset(), offsets[i], tailLen[i]+1);//new Word(cks[i], sen.getStartOffset()+offsets[i]);
      if(tailLen[i] == 0) {	//单字的要取得"字频计算出自由度"
        CharNode cn = cns[i];    //dic.head(chs[offsets[i]]);
        if(cn !=null) {
          ck.words[i].setDegree(cn.getFreq());
        }
      }
    }
  }
  return ck;
}
 
origin: medcl/elasticsearch-analysis-mmseg

  public Chunk seg(Sentence sen) {
    Chunk chunk = new Chunk();
    char[] chs = sen.getText();
    for(int k=0; k<3&&!sen.isFinish(); k++) {
      int offset = sen.getOffset();
      int maxLen;

      //有了 key tree 的支持可以从头开始 max match
      maxLen = dic.maxMatch(chs, offset);
      
      chunk.words[k] = new Word(chs, sen.getStartOffset(), offset, maxLen+1);

      offset += maxLen + 1;
      sen.setOffset(offset);
    }
    
    return chunk;
  }
}
origin: com.chenlb.mmseg4j/mmseg4j-core

  public Chunk seg(Sentence sen) {
    Chunk chunk = new Chunk();
    char[] chs = sen.getText();
    for(int k=0; k<3&&!sen.isFinish(); k++) {
      int offset = sen.getOffset();
      int maxLen = 0;

      //有了 key tree 的支持可以从头开始 max match
      maxLen = dic.maxMatch(chs, offset);
      
      chunk.words[k] = new Word(chs, sen.getStartOffset(), offset, maxLen+1);

      offset += maxLen + 1;
      sen.setOffset(offset);
    }
    
    return chunk;
  }
}
origin: medcl/elasticsearch-analysis-mmseg

bufWord.add(new Word(new char[] {bufSentence.charAt(i)}, startIdx++, Word.TYPE_LETTER_NUMBER));
origin: chenlb/mmseg4j-core

  public Chunk seg(Sentence sen) {
    Chunk chunk = new Chunk();
    char[] chs = sen.getText();
    for(int k=0; k<3&&!sen.isFinish(); k++) {
      int offset = sen.getOffset();
      int maxLen = 0;

      //有了 key tree 的支持可以从头开始 max match
      maxLen = dic.maxMatch(chs, offset);
      
      chunk.words[k] = new Word(chs, sen.getStartOffset(), offset, maxLen+1);

      offset += maxLen + 1;
      sen.setOffset(offset);
    }
    
    return chunk;
  }
}
origin: com.chenlb.mmseg4j/mmseg4j-core

bufWord.add(new Word(new char[] {bufSentence.charAt(i)}, startIdx++, Word.TYPE_LETTER_NUMBER));
origin: chenlb/mmseg4j-core

bufWord.add(new Word(new char[] {bufSentence.charAt(i)}, startIdx++, Word.TYPE_LETTER_NUMBER));
com.chenlb.mmseg4jWord<init>

Popular methods of Word

  • getStartOffset
    此 word 在整个文本中的偏移位置
  • getString
  • getEndOffset
  • getLength
  • getSen
  • getWordOffset
    词在 char[] sen 的偏移位置
  • getType
  • getDegree
  • setDegree

Popular in Java

  • Creating JSON documents from java classes using gson
  • putExtra (Intent)
  • requestLocationUpdates (LocationManager)
  • onRequestPermissionsResult (Fragment)
  • LinkedHashMap (java.util)
    LinkedHashMap is an implementation of Map that guarantees iteration order. All optional operations a
  • Random (java.util)
    This class provides methods that return pseudo-random values.It is dangerous to seed Random with the
  • Scanner (java.util)
    A parser that parses a text string of primitive types and strings with the help of regular expressio
  • Callable (java.util.concurrent)
    A task that returns a result and may throw an exception. Implementors define a single method with no
  • Pattern (java.util.regex)
    Patterns are compiled regular expressions. In many cases, convenience methods such as String#matches
  • JTable (javax.swing)
  • CodeWhisperer alternatives
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now