53 lines
2.1 KiB
Java
53 lines
2.1 KiB
Java
|
package org.ansj.util;
|
|||
|
|
|
|||
|
|
import org.ansj.domain.Term;
|
|||
|
|
import org.ansj.domain.TermNatures;
|
|||
|
|
import org.ansj.recognition.impl.NatureRecognition;
|
|||
|
|
import org.nlpcn.commons.lang.tire.domain.Forest;
|
|||
|
|
import org.nlpcn.commons.lang.util.WordAlert;
|
|||
|
|
|
|||
|
|
public class NameFix {
|
|||
|
|
/**
|
|||
|
|
* 人名消歧,比如.邓颖超生前->邓颖 超生 前 fix to 丁颖超 生 前! 规则的方式增加如果两个人名之间连接是- ， ·，•则连接
|
|||
|
|
*/
|
|||
|
|
public static void nameAmbiguity(Term[] terms, Forest... forests) {
|
|||
|
|
Term from = null;
|
|||
|
|
Term term = null;
|
|||
|
|
Term next = null;
|
|||
|
|
for (int i = 0; i < terms.length - 1; i++) {
|
|||
|
|
term = terms[i];
|
|||
|
|
if (term != null && term.termNatures() == TermNatures.NR && term.getName().length() == 2) {
|
|||
|
|
next = terms[i + 2];
|
|||
|
|
if (next.termNatures().personAttr.split > 0) {
|
|||
|
|
term.setName(term.getName() + next.getName().charAt(0));
|
|||
|
|
terms[i + 2] = null;
|
|||
|
|
|
|||
|
|
String name = next.getName().substring(1);
|
|||
|
|
terms[i + 3] = new Term(name, next.getOffe() + 1,
|
|||
|
|
new NatureRecognition(forests).getTermNatures(name));
|
|||
|
|
TermUtil.termLink(term, terms[i + 3]);
|
|||
|
|
TermUtil.termLink(terms[i + 3], next.to());
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// 外国人名修正
|
|||
|
|
for (int i = 0; i < terms.length; i++) {
|
|||
|
|
term = terms[i];
|
|||
|
|
if (term != null && term.getName().length() == 1 && i > 0
|
|||
|
|
&& WordAlert.CharCover(term.getName().charAt(0)) == '·') {
|
|||
|
|
from = term.from();
|
|||
|
|
next = term.to();
|
|||
|
|
|
|||
|
|
if (from.natrue().natureStr.startsWith("nr") && next.natrue().natureStr.startsWith("nr")) {
|
|||
|
|
from.setName(from.getName() + term.getName() + next.getName());
|
|||
|
|
TermUtil.termLink(from, next.to());
|
|||
|
|
terms[i] = null;
|
|||
|
|
terms[i + 1] = null;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
}
|
|||
|
|
}
|