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 successfully compiled and run on a Windows system. The program output is also shown below.
package com.maixuanviet.setandstring; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class WagnerandFischer { public int getLevenshteinDistance(String str1, String str2) { int len1 = str1.length(); int len2 = str2.length(); int[][] arr = new int[len1 + 1][len2 + 1]; for (int i = 0; i <= len1; i++) arr[i][0] = i; for (int i = 1; i <= len2; i++) arr[0][i] = i; for (int i = 1; i <= len1; i++) { for (int j = 1; j <= len2; j++) { int m = (str1.charAt(i - 1) == str2.charAt(j - 1)) ? 0 : 1; arr[i][j] = Math.min( Math.min(arr[i - 1][j] + 1, arr[i][j - 1] + 1), arr[i - 1][j - 1] + m); } } return arr[len1][len2]; } public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter string 1 :"); String str1 = br.readLine(); System.out.println("Enter string 2 :"); String str2 = br.readLine(); WagnerandFischer wf = new WagnerandFischer(); int lDist = wf.getLevenshteinDistance(str1, str2); System.out.println("Edit (Levenshtein) Distance between two strings = " + lDist); br.close(); } }
Output:
$ javac WagnerandFischer.java $ java WagnerandFischer Enter string 1 : Wagner and Fisher Algorithm Enter string 2 : Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel & Device Driver Programming. Our Founder has trained employees of almost all Top Companies in India. Here are few of them: VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium Networks, ST Microelectronics, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Northwest Bank, Mphasis, Tata Elxsi, Tata Communications, Mindtree, Cognizant, mid size IT companies and many Startups. Students from top Universities and colleges such as NIT Trichy, BITS Pilani, University of California, Irvine, University of Texas, Austin & PESIT Bangalore have benefited a lot from these courses as well. The assignments and real time projects for our courses are of extremely high quality with excellent learning curve. Edit (Levenshtein) Distance between two strings = 844
Related posts:
Guide to the Volatile Keyword in Java
Java Program to Implement Johnson’s Algorithm
Hướng dẫn Java Design Pattern – Observer
Java Program to Find the Median of two Sorted Arrays using Binary Search Approach
Java – Rename or Move a File
Anonymous Classes in Java
Registration – Password Strength and Rules
The Spring @Controller and @RestController Annotations
Java Program to Find the Edge Connectivity of a Graph
Guide to the Java TransferQueue
Java Program to Convert a Decimal Number to Binary Number using Stacks
Map Serialization and Deserialization with Jackson
Java Program to Perform Complex Number Multiplication
Java Program to Implement the MD5 Algorithm
Java Program to Implement Fermat Factorization Algorithm
Spring Boot - Eureka Server
Java Program to Implement LinkedBlockingDeque API
Guide to @JsonFormat in Jackson
Spring Boot - Building RESTful Web Services
Predicate trong Java 8
Spring AMQP in Reactive Applications
Spring MVC Setup with Kotlin
The Registration API becomes RESTful
Dockerizing a Spring Boot Application
Spring Security and OpenID Connect
wait() and notify() Methods in Java
How to Remove the Last Character of a String?
Introduction to Spring Cloud OpenFeign
A Guide to WatchService in Java NIO2
Java Program to Solve the Fractional Knapsack Problem
Java Program to Find Transpose of a Graph Matrix
Running Spring Boot Applications With Minikube