outatime (6/1/2009)

---

I'm using this in my current project and it's working great. Thanks for taking time to put together a nice article we can all follow!

My site is used to search through a large technical publication. Everything has been working great, but a few days ago I typed in "orthostatic" and it threw an error.

I stepped threw the code and after the following:

AstNode root;
root = _compiler.Parse("orthostatic");

"root" is coming back null, so when I pass it to:

string myString;
myString = SearchGrammar.ConvertQuery(root, SearchGrammar.TermType.Inflectional);

the switch statement in the ConvertQuery method throws the error.

Before I do a "quick" workaround for nulls, I wanted to see if you had any insight on what might be causing this.

I've been using the search for quite a while and this is the only one that has caused an issue so far.

Btw, I'm using version 1.0 of the Irony.dll.

Thanks!

james.spibey (3/30/2009)

---

Hi Mike,

Thanks for responding. Unfortunately that didn't seem to do it. I notice that there is an explicit check for the "-" character in the "AndExpression" case statement in ConvertQuery and also a reference to the ExcludeOperator in the defintion of the AndOperator. I wonder does something need to be added to these also to make it recognise the "NOT" keyword? Or could it be a stopword issue?

Thanks

James

rivantsov (6/11/2009)

---

Hi folks
this is Roman, Irony developer
Just wanted to let everybody know that I've refactored SearchGrammar to work with latest version of Irony and added it to Sample grammars in download. The original grammar and conversion method had been tweaked a bit, as some of the old functionality in Irony (node bubbling) had been refactored into similar but different thing. As a result, the output tree is different from Mike's version, but the query conversion result should be the same.
I didn't try the new grammar against database, so cannot garantee 100% bug free status. Any comments, test runs against real SQL database would be appreciated
thank you
Roman

cghersi (7/15/2009)

---

Dear Michael,

first of all, thank you very much for your articles, always very interesting for me.

Let's talk about your article related to the FTS features of SQL server (Google-like search).

I have ths problem: I would like to emulate the FTS feature inside a C# application, without calling my SQL server DB.
That is, I simply want to have a routine taking in input a text string and a search string, and returning true or false if the search string matches or not the text string.

Do you know anything about this issue?
Perhaps someone has already solved my problem...

Please, let me know something, I'm struggling about this dilemma!!!
my email address is: cghersi@foldier.com

thank you very much!!

Cristiano

derek (7/24/2009)

---

I am perhaps loosing my mind, but the conclusion says code can be downloaded from the link above. But the only link I can find is to http://www.codeplex.com/irony, not the source for the article itself.

Thanks
Derek