Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

bug fix for issue 662 #835

Open
wants to merge 1 commit into
base: 6.x
Choose a base branch
from
Open

bug fix for issue 662 #835

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions src/main/java/org/wltea/analyzer/core/AnalyzeContext.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,6 +29,7 @@
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.TreeSet;
import java.util.Map;
import java.util.Set;

Expand Down Expand Up @@ -72,7 +73,7 @@ class AnalyzeContext {
//LexemePath位置索引表
private Map<Integer , LexemePath> pathMap;
//最终分词结果集
private LinkedList<Lexeme> results;
private TreeSet<Lexeme> results;
//分词器配置项
private Configuration cfg;

Expand All @@ -83,7 +84,7 @@ public AnalyzeContext(Configuration configuration){
this.buffLocker = new HashSet<String>();
this.orgLexemes = new QuickSortSet();
this.pathMap = new HashMap<Integer , LexemePath>();
this.results = new LinkedList<Lexeme>();
this.results = new TreeSet<Lexeme>();
}

int getCursor(){
Expand Down Expand Up @@ -361,7 +362,7 @@ private void compound(Lexeme result){
if(!this.results.isEmpty()){

if(Lexeme.TYPE_ARABIC == result.getLexemeType()){
Lexeme nextLexeme = this.results.peekFirst();
Lexeme nextLexeme = this.results.first();
boolean appendOk = false;
if(Lexeme.TYPE_CNUM == nextLexeme.getLexemeType()){
//合并英文数词+中文数词
Expand All @@ -378,7 +379,7 @@ private void compound(Lexeme result){

//可能存在第二轮合并
if(Lexeme.TYPE_CNUM == result.getLexemeType() && !this.results.isEmpty()){
Lexeme nextLexeme = this.results.peekFirst();
Lexeme nextLexeme = this.results.first();
boolean appendOk = false;
if(Lexeme.TYPE_COUNT == nextLexeme.getLexemeType()){
//合并中文数词+中文量词
Expand Down