anonymous
  • anonymous
İ need a function for a search machine, that this function should find the most-looking like string values to the users input, example: if user writes "Math" this function must find the "mathematics" keyword and match it to the pertinent links and list them, then another function should list them on screen :d
Computer Science
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
are you assuming that they will provide input starting at the beginning of the string? Or could they enter "ematics" and expect to get "mathematics"? With out thinking about the problem much, it could be solved using trees. It is an interesting problem but if you are not extremely familiar with linear data-structures (arrays, stacks, queues) and recursion. You might want to start there and build up to recursively based non-linear data-structures. That said, using a tree is how I would solve the problem.
rsmith6559
  • rsmith6559
Word completions can be done with a Markov sequence. Finding words that can be extended from a partial like math could be done with a lexicon ( dictionary without definitions ) based on a set.
anonymous
  • anonymous
If you know the concepts of KARNAK - used in AJAX.. will help you to solve your problem..It is only possible if you are using code in some Web based Technologies like(JSP.STRUCTS,SERVLETS/PHP/C#) it is not possible to use with C,C++ since they are not web based. Better try using the Concepts of Binary trees where it uses the parsing of string w.r.t the give input string.. All the best

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
there are lot of string matching functions in algorithms like knuth-matt-pratt (KMP algorithm)...u can go thru book called algorithms by cormen...which gives u lot of info

Looking for something else?

Not the answer you are looking for? Search for more explanations.