[jira] [Updated] (LUCENE-10493) Can we unify the viterbi search logic in the tokenizers of kuromoji and nori?

["Tomoko Uchida (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/LUCENE-10493?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Tomoko Uchida updated LUCENE-10493:
-----------------------------------
    Summary: Can we unify the viterbi search logic in the tokenizers of kuromoji and nori?  (was: Can we unify the tokenizer of kuromoji and nori?)

> 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
>
> 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()` that 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 - that is only supported by JapaneseTokenizer and not by KoreanTokenizer.



--
This message was sent by Atlassian Jira
(v8.20.1#820001)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org