Hi,
Please remember than unmunch does not guarantee a one-to-one mapping
between words and root forms. For example, an unmunched word may be
generated by many different root words and affixes and not just once.
That is why the unmunched list of words is typically uniquely sorted
to remove duplicates.
The basic idea is that a raw word list when compressed by affix
compression (munch) will always expand (unmunch) to exactly the same
raw word list after sorting uniquely with no additions or deletions.
FWIW,
Kevin
On Apr 10, 2007, at 2:31 PM, Oleg Burlaca wrote:
Jancs wrote:
i suppose, you have to edit unmuch source to get such option.
Janis
Yes Jancs, you was write, I've modified the /src/tools/unmunch.c
file from the hunspell package.
Just added a line:
fprintf(stdout, "%s\n", "---");
after the block that writes out wordforms:
for (i=0; i < numwords; i++) {
fprintf(stdout,"%s\n",wlist[i].word);
free(wlist[i].word);
wlist[i].word = NULL;
wlist[i].pallow = 0;
}
It was easier than I thought :))
Thanks.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: dev-
[EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
