Uwe Schmidt

I think a single update command is sufficient. When the ApiDocument does not contain an index part, the index update can be skipped and the operation becomes cheap. The description...

In the last 2 weeks I've worked a bit on a refactoring of the query evaluation with the goal to separate query search, which computes a set of scored docids,...

I've just pushed the refactored scoring algorithm and the completion algorithm to github. The completion alg. computes suggestions for the very last word or prefix, but it takes into account...

In the given query we have to change the exact word search to a prefix search. The phrase search `QPhrase ...` is currently (on the fly) transformed into ``` haskell...

I've pushed a modified ClientInterface to github to make the query from the last comment (and others) ``` haskell qNext $ map (setNoCaseSearch . qWord) ["thomas", "strun"] ``` a bit...

A generalization of the completion algorithm for queries with a phrase as rightmost sub-query (or just a phrase query) should not be a big deal. It's rather easy to get...

Hi Erik, this summer I had to do other things than HXT stuff. But now I'm back at work and there should be some time for maintaining HXT. Please send...

please use the workaround at the moment. I will see, whether I can unify the datatype library stuff from relaxng and xmlschema into a common package, to eliminate this currently...

At a first view it seems, this is a rather large change for getting rid of the `withoutNav`. There is already a filter `filterAxis`, which take a simple arrow for...

you're right, if that `withoutNav` is spread all over the code, the generalization makes sence