Blake,
Thanks for pointing that out. In both cases the documentation is incorrect
and should match the implementation. I also see that step 5 is not correctly
defined: I will put in exact documentation soon and let you know when it is
in place,
Martin
>I have a couple of questions about the Finnish stemming algorithm. In your
>documention, you state that in step 4 to look for the suffixes in R1;
>however, in the Snowball implementation it looks for the suffixes (e.g.,
>"mpi") in R2. Which is correct?
>
>Also, in the Snowball implementation step 3 will delete the endings "ta" and
>"tä"; however, the documentation does not mention these ending. Is it
>correct to delete these endings? Did the documentation just forget to
>mention this?
>
>Thanks,
>Blake Madden
This archive was generated by hypermail 2.1.3 : Thu Sep 20 2007 - 12:02:46 BST