Question

how to find most repeated bi-grams (pairs of words) in the text by using java. (without using Hashmap )

Answer 1

Program:

import java.util.*;
import java.io.*;

//Bigrams class
class Bigrams
{
   //main method
   public static void main (String[] args) throws IOException
   {
       //open the text file
       Scanner sc = new Scanner(new File("bigrams.txt"));

       //create an array of strings
       String text[] = new String[1000];
      
       int n;
       for(n=0; sc.hasNext(); n++)
       {
           //read a String from the file
           String s = sc.next();
           //convert to lower case
           s = s.toLowerCase();
           //remove the punctuation
           s = s.replaceAll("\\p{Punct}","");
           text[n] = s;
       }
       //declare the array of count
       int count[] = new int[n-1];
       //declare the array of bigrams
       String bigrams[][] = new String[n-1][2];
      
       int m = 0, j;
       //processing
       for(int i=0; i<n-1; i++)
       {
           for(j=0; j<m; j++)
           {
               //check for existing bigrams
               if(text[i].equalsIgnoreCase(bigrams[j][0]) && text[i+1].equalsIgnoreCase(bigrams[j][1]))
               {
                   count[j]++;
                   break;
               }
           }
           //for non-existing bigrams
           if(j==m)
           {
               bigrams[m][0] = text[i];
               bigrams[m][1] = text[i+1];
               count[j] = 1;
               m++;
           }
       }
      
       int max=0;
       j = 0;
       //calculate maximum frequency
       for(int i=0; i<m; i++)
       {
           if(count[i]>max)
           {
               max = count[i];
               j = i;
           }
       }
       //print the most repeated bi-grams
       System.out.println("Most repeated bi-grams: " + bigrams[j][0] + " " + bigrams[j][1]);
   }
}

bigrams.txt

The book I read was called A Wrinkle In Time. In the book there is a main character named Meg. Meg and her brother Charles Wallace and a guy named Calvin go on a trip across time and space. They are trying to save their father, a scientist. The dad has been captured by a creature in another galaxy. The kids save the dad and go home using a tesseract.

Output:

Most repeated bi-grams: the book