Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 546211
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T10:50:35+00:00 2026-05-13T10:50:35+00:00

I would like to compare two strings and get some score how much these

  • 0

I would like to compare two strings and get some score how much these look alike.
For example “The sentence is almost similar” and “The sentence is similar”.

I’m not familiar with existing methods in Java, but for PHP I know the levenshtein function.

Are there better methods in Java?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T10:50:35+00:00Added an answer on May 13, 2026 at 10:50 am

    The Levensthein distance is a measure for how similar strings are. Or, more precisely, how many alterations have to be made that they are the same.

    The algorithm is available in pseudo-code on Wikipedia. Converting that to Java shouldn’t be much of a problem, but it’s not built-in into the base class library.

    Wikipedia has some more algorithms that measure similarity of strings.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I would like to compare two dates in javascript. I have been doing some
I would like to compare two tables and then update if some logic is
I have two arrays of strings that I would like to compare for equality:
I would like to be able to compare two classes derived from the same
I would like to know if there is anyway I can compare two columns
I have two arrays that I would like to compare and ultimately wind up
I'm looking to compare two varchars in SQL, one would be something like Cafe
I would like to compare 4 character string using wildcards. For example: std::string wildcards[]=
Im trying to compare the values of two edittext boxes. What i would like
I want to compare two WCHAR* strings. How to do it? P.S. I would

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.