[
https://issues.apache.org/jira/browse/LUCENE-10493?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17527428#comment-17527428
]
ASF subversion and git services commented on LUCENE-10493:
----------------------------------------------------------
Commit c89f8a7ea1e7dfa64ab6d85c22dcbb977f8e09d0 in lucene's branch
refs/heads/main from Tomoko Uchida
[ https://gitbox.apache.org/repos/asf?p=lucene.git;h=c89f8a7ea1e ]
LUCENE-10493: factor out Viterbi algorithm and share it between kuromoji and
nori (#805)
> Can we unify the viterbi search logic in the tokenizers of kuromoji and nori?
> -----------------------------------------------------------------------------
>
> Key: LUCENE-10493
> URL: https://issues.apache.org/jira/browse/LUCENE-10493
> Project: Lucene - Core
> Issue Type: Improvement
> Components: modules/analysis
> Reporter: Tomoko Uchida
> Priority: Major
> Time Spent: 3h
> Remaining Estimate: 0h
>
> We now have common dictionary interfaces for kuromoji and nori
> ([LUCENE-10393]). A natural question would be: is it possible to unify the
> Japanese/Korean tokenizers?
> The core methods of the two tokenizers are `parse()` and `backtrace()` to
> calculate the minimum cost path by Viterbi search. I'd set the goal of this
> issue to factoring out them into a separate class (in analysis-common) that
> is shared between JapaneseTokenizer and KoreanTokenizer.
> The algorithm to solve the minimum cost path itself is of course
> language-agnostic, so I think it should be theoretically possible; the most
> difficult part here might be the N-best path calculation - which is supported
> only by JapaneseTokenizer and not by KoreanTokenizer.
--
This message was sent by Atlassian Jira
(v8.20.7#820007)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
