[developers] processing of lexical rules
crysmann at dfki.de
Mon May 2 15:29:45 CEST 2005
what is the current situation for performance tuning of morphological
rules in the LKB?
Are there any features other than limiting the maximal depth of rule
It appears that sequences of highly ambiguous affixes take a lot of
time. Segmentation is quite speedy, but replay can be painfully slow.
Does the rule filter not apply?
More information about the developers