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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T19:37:41+00:00 2026-05-22T19:37:41+00:00

I need an auto-completion routine or library in C++ for 1 million words. I

  • 0

I need an auto-completion routine or library in C++ for 1 million words. I guess I can find a routine on the net like Rabin–Karp. Do you know a library that does this. I don’t see it in Boost.

Also, is it a crazy idea to use MySql LIKE SQL request to do that ?

Thank you

EDIT: It is true that it is more suggestions than auto-completion that I need (propose ten words when the user typed the first 2 letters). I actually also have expressions “Nikon digital camera”. But for a first version, I only need suggestions on “Ni” of Nikon and not on “digital camera”.

  • 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-22T19:37:41+00:00Added an answer on May 22, 2026 at 7:37 pm

    You don’t have to use any crazy algorithm if you begin by preparing an index.

    A simple Trie/Binary Search Tree structure, that keeps the words ordered alphabetically, would allow efficient prefix searches.

    In C++, for example, the std::map class has the lower_bound member which would point in O(log N) to the first element that could possibly extend your word.

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

Sidebar

Related Questions

I've always assigned event handlers like this, guided by Intellisense auto-completion. RangeSelector.RangeChanged += new
I need auto completion in my combobox . In the following code, if I
I'm currently writing an autocompletion for python. Therefore I need to find the modules,
I need to implement auto-capitalization inside of a Telerik RadEditor control on an ASPX
I need help with auto-saving a textarea. Basically, whenever a user is typing in
I need to use ClassMaps instead of auto mapping because of legacy database. But
I need my application installer set the program to auto-startup for all users. Then
I need a cross-browser compatible plugin for textrea to be auto growing and shrinking
I need a jQuery scroller to scroll my divs with auto scrolling facility. I
I need to have one column as the primary key and another to auto

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.