Amir Plivatsky

A correct (hopefully) efficiency shortcut for this loop: ``` c for (c4 = c2; c4 != NULL; c4 = c4->next) { //double maxcost = MAX(c3->maxcost,c4->maxcost); //if (maxcost + e->cost >...

**basic**: Currently parsable but unparsable (as desired) after the cost-cutoff change: ``` *My some female friends were angered by the hearings ``` Unparsable after the cost-cutoff change (need -cost=3): ```...

I'm now encountering this `maxcost` problem when I try to further simplify expressions in `expression_prune()` in order to have less total work in farther simplifications there and especially in `build_clause()`....

> [...] "goes" has a problem [...] Here are my findings: From the dict: ``` text : ((dWV- or dCV- or dIV-) & {VC+}) or [()]; goes.v: ( & (...

``` text linkparser> Maybe it works now... Found 4 linkages (4 had no P.P. violations) Linkage 1, cost vector = (UNUSED=0 DIS= 3.06 LEN=12) +---------------Xx---------------+ +-------->WV------->+ | +----->Wd------+ | |...

As part of cleaning up cost-handling code, I would like to define the following in `dict-structures.h`: 1. Define cost type (currently "double") so it could be easily changed to `float`...

> BTW -- a related issued in the sql-back dicts -- the ones that I sent you will have exactly the same disjunct appearing multiple times, with different costs, each...

>>Or are these UNKNOWN-WORD.a, UNKNOWN_WORD.n etc.? >I think it's that. I ask because I don't understand this: > it will always be the one with the lowest cost The only...

We can host the documentation site on GitHub itself, using a [custom domain](https://help.github.com/articles/using-a-custom-domain-with-github-pages/) for access. Just make a push and the site is updated.

>What is the best way to host the site and guarantee long-term stability? Maybe this: https://pages.github.com/