三元组java_在Java中获取“三元组”

我在Java中获取trigrams时遇到了一些问题。我的程序目前可以获得bigrams，但是当我尝试实现方法的相同结构并将其更改为trigrams时，它似乎无法正常工作。

我希望trigrams在arraylist中获取每个可能的单词组合，例如

Original = [eye, test, find, free, nhs]

Trigram = [eye test find, 2, eye test free, 3, eye test nhs, 4, eye find free, 3, eye find nhs, 4, eye free nhs, 5, etc...]数字确定第一个单词和最后一个单词之间的距离，并且应该在arraylist中获得每个3的单词组合。目前这项工作正常bigrams ...

Original = [eye, test, find, free, nhs]

Bigram = [eye test, 1, eye find, 2, eye free, 3, eye nhs, 4, test find, 1, test free, 2, test nhs, 3, find free, 1, etc..]这里是方法

public ArrayList bagOfWords;

public ArrayList bigramList = new ArrayList();

public ArrayList trigramList = new ArrayList();

public void trigram() throws FileNotFoundException{

PrintWriter tg = new PrintWriter(new File(trigramFile));

// CREATES THE TRIGRAM

for (int i = 0; i < bagOfWords.size() - 1; i++) {

for (int j = 1; j < bagOfWords.size() - 1; j++) {

for(int k = j + 1; k < bagOfWords.size(); k++){

int distance = (k - i);

if (distance < 4){

trigramList.add(bagOfWords.get(i) + " " + bagOfWords.get(j) + " " + bagOfWords.get(k) + ", " + distance);

}

}

}

}

public void bigram() throws FileNotFoundException{

// CREATES THE BIGRAM

PrintWriter bg = new PrintWriter(new File(bigramFile));

for (int i = 0; i < bagOfWords.size() - 1; i++) {

for (int j = i + 1; j < bagOfWords.size(); j++) {

int distance = (j - i);

if (distance < 4){

bigramList.add(bagOfWords.get(i) + " " + bagOfWords.get(j) + ", " + distance);

}

}

}任何人都可以帮我改变trigram()方法来创建一个适合我需要的trigram的方法吗？

谢谢你的帮助。