-
Notifications
You must be signed in to change notification settings - Fork 90
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Reading a full forms lexicon #130
Comments
You can use
produces a transducer that maps |
Thank you, surely that can help us to have a morphological analyzer out of our full-forms Portuguese Lexicon at https://github.com/LR-POR/MorphoBr/. But, of course, such a transducer is not the perfect solution since it does not capture the rules of the morphology nor the position classes and the respective morphemes.
|
Hi @mhulden,
I got a
|
I was able to compile the spaced-text files
with the foma script
after changing the https://github.com/mhulden/foma/blob/master/foma/int_stack.c#L22 to |
The only strange behaviour I got is that adjectives are not considered:
Any idea? |
Consider doing this instead of save defined
(save defined saves several FSTs and flookup only loads one - with the above, you should get a single FST one the stack and save that.) |
Thanks, it worked. The strange behavior is that I tested it with nouns and verbs, and it works. That is, an ambiguous word. The problem may be that without this explicit combination of the FSTs with the disjunction. We ended up with an FST with multiple starting states, and the Anyway, the explicit disjunction to combine the FSTs worked fine! |
The words command produce all pairs of up/lower words. Do we have any command do read a file with those pairs and produce an fst from the pairs?
The text was updated successfully, but these errors were encountered: