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 218257
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T18:44:01+00:00 2026-05-11T18:44:01+00:00

I have been playing around a bit with a fairly simple, home-made search engine,

  • 0

I have been playing around a bit with a fairly simple, home-made search engine, and I’m now twiddling with some relevancy sorting code.

It’s not very pretty, but I’m not very good when it comes to clever algorithms, so I was hoping I could get some advice 🙂

Basically, I want each search result to get scoring based on how many words match the search criteria. 3 points per exact word and one point for partial matches

For example, if I search for “winter snow”, these would be the results:

  • winter snow => 6 points
  • winter snowing => 4 points
  • winterland snow => 4 points
  • winter sun => 3 points
  • winterland snowing => 2 points

Here’s the code:

String[] resultWords = result.split(" ");
String[] searchWords = searchStr.split(" ");
int score = 0;
for (String resultWord : resultWords) {
    for (String searchWord : searchWords) {
        if (resultWord.equalsIgnoreCase(searchWord))
            score += 3;
        else if (resultWord.toLowerCase().contains(searchWord.toLowerCase()))
            score++;
    }
}
  • 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-11T18:44:01+00:00Added an answer on May 11, 2026 at 6:44 pm

    Your code seems ok to me. I suggest little changes:

    Since your are going through all possible combinations you might get the toLowerCase() of your back at the start.

    Also, if an exact match already occurred, you don’t need to perform another equals.

        result = result.toLowerCase();
        searchStr = searchStr.toLowerCase();
    
        String[] resultWords = result.split(" ");
        String[] searchWords = searchStr.split(" ");
        int score = 0;
        for (String resultWord : resultWords) {
            boolean exactMatch = false;
            for (String searchWord : searchWords) {
                if (!exactMatch && resultWord.equals(searchWord)) {
                    exactMatch = true;
                    score += 3;
                } else if (resultWord.contains(searchWord))
                    score++;
            }
        }
    

    Of course, this is a very basic level. If you are really interested in this area of computer science and want to learn more about implementing search engines start with these terms:

    • Natural Language Processing
    • Information retrieval
    • Text mining
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 248k
  • Answers 248k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer You can only have one clustered index per table. It… May 13, 2026 at 8:47 am
  • Editorial Team
    Editorial Team added an answer This pushes the boundaries of my understanding of how Ruby… May 13, 2026 at 8:47 am
  • Editorial Team
    Editorial Team added an answer MTJ has a Sparse Vector class. It has norm functions… May 13, 2026 at 8:47 am

Related Questions

I have been playing around with jQuery for a bit now, and am really
This is a two part question. A dumb technical query and a broader query
I have been playing around with in app purchases for a few days, everything
I have been playing around with the MS Source Server stuff in the MS

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

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.