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

  • SEARCH
  • Home
  • 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 7045197
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T02:30:04+00:00 2026-05-28T02:30:04+00:00

I’m attempting to find an example that demonstrates a Lucene or some other kind

  • 0

I’m attempting to find an example that demonstrates a Lucene or some other kind of index that can check an English first & last name combination for possible duplicates. The duplicate check needs to be able to take into account common nicknames, i.e. Bob for Robert and Bill for William, as well as spelling mistakes. Does anyone know of an example?

I plan to perform the duplicates search during user registration. The new user record needs to be checked against an index that has been built from the database table that stores the user names.

  • 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-28T02:30:05+00:00Added an answer on May 28, 2026 at 2:30 am

    I would use a SynonymFilter on the firstName while indexing, so that you have all possible combinations (Bob -> Robert, Robert -> Bob, etc…). Index the existing users you have.

    Then use the QueryParser (without the SynonymFilter in the analyzer) to ask some fuzzy queries.

    This is the code I came up with:

    public class NameDuplicateTests {
        private Analyzer analyzer;
        private IndexSearcher searcher;
        private IndexReader reader;
        private QueryParser qp;
    
        private final static Multimap<String, String> firstNameSynonyms;
        static {
            firstNameSynonyms = HashMultimap.create();
            List<String> robertSynonyms = ImmutableList.of("Bob", "Bobby", "Robert");
            for (String name: robertSynonyms) {
                firstNameSynonyms.putAll(name, robertSynonyms);
            }
            List<String> willSynonyms = ImmutableList.of("William", "Will", "Bill", "Billy");
            for (String name: willSynonyms) {
                firstNameSynonyms.putAll(name, willSynonyms);
            }
        }
    
        public static Analyzer createAnalyzer() {
            return new Analyzer() {
                @Override
                public TokenStream tokenStream(String fieldName, Reader reader) {
                    TokenStream tokenizer = new WhitespaceTokenizer(reader);
                    if (fieldName.equals("firstName")) {
                        tokenizer = new SynonymFilter(tokenizer, new SynonymEngine() {
                            @Override
                            public String[] getSynonyms(String s) throws IOException {
                                return firstNameSynonyms.get(s).toArray(new String[0]);
                            }
                        });
                    }
                    return tokenizer;
                }
            };
        }
    
    
        @Before
        public void setUp() throws Exception {
            Directory dir = new RAMDirectory();
            analyzer = createAnalyzer();
    
            IndexWriter writer = new IndexWriter(dir, analyzer, IndexWriter.MaxFieldLength.UNLIMITED);
            ImmutableList<String> firstNames = ImmutableList.of("William", "Robert", "Bobby", "Will", "Anton");
            ImmutableList<String> lastNames = ImmutableList.of("Robert", "Williams", "Mayor", "Bob", "FunkyMother");
    
            for (int id = 0; id < firstNames.size(); id++) {
                Document doc = new Document();
                doc.add(new Field("id", String.valueOf(id), Field.Store.YES, Field.Index.NOT_ANALYZED));
                doc.add(new Field("firstName", firstNames.get(id), Field.Store.YES, Field.Index.ANALYZED));
                doc.add(new Field("lastName", lastNames.get(id), Field.Store.YES, Field.Index.NOT_ANALYZED));
                writer.addDocument(doc);
            }
            writer.close();
    
            qp = new QueryParser(Version.LUCENE_30, "firstName", new WhitespaceAnalyzer());
            searcher = new IndexSearcher(dir);
            reader = searcher.getIndexReader();
        }
    
        @After
        public void tearDown() throws Exception {
            searcher.close();
        }
    
        @Test
        public void testNameFilter() throws Exception {
            search("+firstName:Bob +lastName:Williams");
            search("+firstName:Bob +lastName:Wolliam~");
        }
    
        private void search(String query) throws ParseException, IOException {
            Query q = qp.parse(query);
            System.out.println(q);
            TopDocs res = searcher.search(q, 3);
            for (ScoreDoc sd: res.scoreDocs) {
                Document doc = reader.document(sd.doc);
                System.out.println("Found " + doc.get("firstName") + " " + doc.get("lastName"));
            }
        }
    }
    

    Which results in:

    +firstName:Bob +lastName:Williams
    Found Robert Williams
    +firstName:Bob +lastName:wolliam~0.5
    Found Robert Williams
    

    Hope that helps!

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

Sidebar

Related Questions

I'm parsing an RSS feed that has an &#8217; in it. SimpleXML turns this
link Im having trouble converting the html entites into html characters, (&# 8217;) i
That's pretty much it. I'm using Nokogiri to scrape a web page what has
I have just tried to save a simple *.rtf file with some websites and
For some reason, after submitting a string like this Jack’s Spindle from a text
I have a jquery bug and I've been looking for hours now, I can't
I have a string like this: La Torre Eiffel paragonata all&#8217;Everest What PHP function
I've got a string that has curly quotes in it. I'd like to replace
I have a French site that I want to parse, but am running into
I am doing a simple coin flipping experiment for class that involves flipping a

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.