What steps will reproduce the problem?
I define 25 output combination in lexc:
LEXICON Ninf
+N+Nom:0 #;
+N+Pl:^Ok #;
+N+Abl:t^Ul #;
+N+Gen:é #;
+N+Fam:ék #;
+N+Fam+Abl:ékt^Ul #;
+N+Fam+Gen+Abl:ékét^Ul #;
+N+Ess:^Zl #;
+N+Posss1:^Bm #;
+N+Posss2:^Bd #;
+N+Posss3:^J^A #;
+N+Posss1+Abl:^Bmt^Ul #;
+N+Posss2+Abl:^Bdt^Ul #;
+N+Posss3+Abl:^J^Ct^Ul #;
+N+Pl+Gen:^Oké #;
+N+Fam+Gen:éké #;
+N+Pl+Abl:^Okt^Ul #;
+N+Gen+Abl:ét^Ul #;
+N+Pl+Gen+Abl:^Okét^Ul #;
+N+Posss1+Gen:^Bmé #;
+N+Posss2+Gen:^Bdé #;
+N+Posss3+Gen:^J^Cé #;
+N+Posss1+Gen+Abl:^Bmét^Ul #;
+N+Posss2+Gen+Abl:^Bdét^Ul #;
+N+Posss3+Gen+Abl:^J^Cét^Ul #;
What is the expected output? What do you see instead?
I would expect 25 output combinations, but I get 37:
foma[28]: upper-words
rege+N+Nom
rege+N+Gen
rege+N+Gen+Abl
rege+N+Fam
rege+N+Fam+Abl
rege+N+Fam+Gen
rege+N+Fam+Gen+Abl
rege+N+Abl
rege+N+Posss2+Gen
rege+N+Posss2+Gen+Abl
rege+N+Posss2+Abl
rege+N+Posss2
rege+N+Posss1+Gen
rege+N+Posss1+Gen+Abl
rege+N+Posss1+Abl
rege+N+Posss1
rege+N+Ess
rege+N+Pl+Abl
rege+N+Pl+Gen
rege+N+Pl+Gen+Abl
rege+N+Pl
rege+N+Posss3+Gen
rege+N+Posss3+Gen+Abl
rege+N+Posss3+Abl
rege+N+Posss3
rege+N+Posss2+Gen
rege+N+Posss2+Gen+Abl
rege+N+Posss2+Abl
rege+N+Posss2
rege+N+Posss1+Gen
rege+N+Posss1+Gen+Abl
rege+N+Posss1+Abl
rege+N+Posss1
rege+N+Pl+Abl
rege+N+Pl+Gen
rege+N+Pl+Gen+Abl
rege+N+Pl
(12 get duplicated, the last 12)
What version of the product are you using? On what operating system?
Foma, version 0.9.16alpha
Linux
Please provide any additional information below.
foma and lex files attached
Original issue reported on code.google.com by eleonor...@gmx.net on 29 Dec 2011 at 4:53
After having corrected the Lexicon Ninf part in the lexc file, the reported
error is gone, probably caused by the lexc error. Added the correct working
files for reference, we can close this issue.
Original comment by eleonor...@gmx.net on 29 Dec 2011 at 10:30
Original issue reported on code.google.com by
eleonor...@gmx.net
on 29 Dec 2011 at 4:53Attachments: