-
Notifications
You must be signed in to change notification settings - Fork 133
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
Question: how to obtain multiple parsings? #99
Comments
I see that, since I asked this, Question: I’ve been using Maven, e.g., for kuromoji-unidic but these were last updated in September 2015. I’ll try to get my build tool (leiningen) to use a cloned Git repo but I was wondering if there were plans on bumping the versions on Maven soon? Thanks! |
We're planning on publishing a new version to Maven soon. We'd like to let the n-best APIs to bake a little bit before we release the new version, though. Any feedback you have on usage, etc. would be greatly appreciated. Thanks! |
Thanks for the info! This is probably not the best place to ask about it, forgive me, but:
With the first sentence, Any suggestions? (In both these sentences, the lowest-cost tokenization uses 出来る, instead of で+来る, which is what I expected. For the first sentence above, Update: same problem happens with IPADIC too, so it’s not a UniDic issue. Update the second: |
Sorry for the slow response here. Emanuel is looking into a fix and we hope to have something you can test soon. |
I found the overflow error. A fix will be coming soon! |
MeCab has a
-N
flag with which a user can specify the top-N results to get back. On http://www.atilika.org/ the Viterbi algorithm's output graph shows all possible morphemes, along with the cost of each path, so I'm sure it's possible to get the top, say, five results, but is there a simpler way to get this, the equivalent ofmecab -N 5
? I'm using UniDic. Thank you 🙇!The text was updated successfully, but these errors were encountered: