Creating a complex text parser for search engines

  • Thread starter richard_b_lloyd
  • Start date
R

richard_b_lloyd

I've noticed that there are tons of tutories for creating search
engines / search pages using vb.net. What all of these tutorials don't
cover is how to parse the search text the user has enetered to handle
complex boolean searches such as, e.g. "Animal AND NOT (Cat OR Dog)"

Does anyone know of any good (Free) tutorials on text parsing that
could help me create a more complex parser than the normal and
restrictive boolean AND search on all words?
 
R

rowe_newsgroups

I've noticed that there are tons of tutories for creating search
engines / search pages using vb.net. What all of these tutorials don't
cover is how to parse the search text the user has enetered to handle
complex boolean searches such as, e.g. "Animal AND NOT (Cat OR Dog)"

Does anyone know of any good (Free) tutorials on text parsing that
could help me create a more complex parser than the normal and
restrictive boolean AND search on all words?

Well, how you parse the search string would depend on how your search
algorithm works. What's the link to the tutorial you are using for the
search engine? Perhaps if I see how it performs the search I could
help you with the parser.

Thanks,

Seth Rowe
 
R

Rad [Visual C# MVP]

I've noticed that there are tons of tutories for creating search
engines / search pages using vb.net. What all of these tutorials don't
cover is how to parse the search text the user has enetered to handle
complex boolean searches such as, e.g. "Animal AND NOT (Cat OR Dog)"

Does anyone know of any good (Free) tutorials on text parsing that
could help me create a more complex parser than the normal and
restrictive boolean AND search on all words?
Have a look at the source code for lucene.net to get ideas on this ...
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Top