Category Archives: Java Algorithms – String

This is a java program to search string using simple algorithm BoyerMoore. Here is the source code of the Java Program to Implement the String Search Algorithm for Short Text Sizes. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.util.Scanner; class BoyerMoore{ private … Read more

This is a java program to repeatedly search a string from the sample string. Here is the source code of the Java Program to Repeatedly Search the Same Text (such as Bible by building a Data Structure). The Java program is successfully compiled and run on a Windows system. The program output is also shown … Read more

This is a java program to implement Aho-Corasick Algorithm. It is a kind of dictionary-matching algorithm that locates elements of a finite set of strings (the “dictionary”) within an input text. It matches all patterns simultaneously. The complexity of the algorithm is linear in the length of the patterns plus the length of the searched … Read more

This is a java program to implement grep linux command. Here is the source code of the Java Program to Implement the Program Used in grep/egrep/fgrep. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.Scanner;import java.util.regex.Matcher;import java.util.regex.Pattern; public class GrepCommandImplementation{ … Read more

This is a java program to perform Naive String matching algorithm. Here is the source code of the Java Program to Perform Naive String Matching. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.util.Scanner; public class StringSearchUsingNaiveMethod{ private final int BASE; private int[] … Read more

This is a java program to perform search using string library. Here is the source code of the Java Program to Perform String Matching Using String Library. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.util.Scanner; public class StringSearchUsingStrLib{ public static void main(String[] … Read more

This is a java program to perform search using Vectors. Here is the source code of the Java Program to Implement String Matching Using Vectors. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.util.Scanner;import java.util.Vector; public class StringSearchUsingVectors{ public static void main(String[] args) … Read more

This is a java program to solve approximate string matching using dynamic programming. Here is the source code of the Java Program to Use Dynamic Programming to Solve Approximate String Matching. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.  package com.sanfoundry.setandstring; import java.util.ArrayList;import java.util.Collections;import java.util.HashMap;import … Read more

This is a java program to implement Levenshtein Distance Computing Algorithm. In computer science, edit distance is a way of quantifying how dissimilar two strings (e.g., words) are to one another by counting the minimum number of operations required to transform one string into the other. Edit distances find applications in natural language processing, where … Read more

This is a java program to implement Wagner and Fisher Algorithm. In computer science, the Wagner–Fischer algorithm is a dynamic programming algorithm that computes the edit distance between two strings of characters. Here is the source code of the Java Program to Implement Wagner and Fisher Algorithm for online String Matching. The Java program is … Read more