I had been trying to encode my queries as CQL, but there are some problems:
- It's painfully verbose, resulting in ridiculous URLs
- (( A prox B) not (( A prox B) prox C)) is not equivalent to (A near B) not near C
XTF would be nice, except:
- The tokenization and display requirements of the DDb project appear to be beyond the XTF customization options
- Substring searching
- Lemmatized forms
- Honestly, I'm still a little unsatisfied with the way queries are encoded in URLs
So far, things look pretty promising. I think I can capture the text searching requirements pretty well with 8 or 9 defined functions and a few "barewords" to indicate mode of sensitivity to case, etc.
An ugly CQL example:
prox/unit=word/distance<=1 cql.keywords=/locale=grc.beta/ignoreCapitals/ignoreAccents "^upoqhkhs^") prox/unit=word/distance<=2 (cql.keywords=/locale=grc.beta/ignoreCapitals/ignoreAccents"^dik")))
versus something like:
then( beta("^kai^ ^upoqhkhs^",IA), beta("^dik",IA), 2 )
Single Zero Roulette – High Stakes from Tropicana Atlantic City on-line. You can wager a lot as} $4,000 on every 카지노사이트 spin, cranking up the stress with each round. Everything is offered on one screen so you can to|you possibly can} quickly see what all is going on with no distractions or additional displays to keep observe of.
Post a Comment