19 citations · 59 across the 13 of their papers we have counts for
15 papers
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation
Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I +3
In this study, we propose a simple and effective preprocessing method for subword segmentation based on a data compression algorithm. Compression-based subword segmentation has rec…
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption
Shinji Ono, Jun Takata, Masaharu Kataoka +3
For the feature selection problem, we propose an efficient privacy-preserving algorithm. Let , , and be data, feature, and class sets, respectively, where the feature val…
Faster Privacy-Preserving Computation of Edit Distance with Moves
Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake +3
We consider an efficient two-party protocol for securely computing the similarity of strings w.r.t. an extended edit distance measure. Here, two parties possessing strings and…
Practical Random Access to SLP-Compressed Texts
Travis Gagie, Tomohiro I, Giovanni Manzini +4
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construct…
Rpair: Rescaling RePair with Rsync
Travis Gagie, Tomohiro I, Giovanni Manzini +3
Data compression is a powerful tool for managing massive but repetitive datasets, especially schemes such as grammar-based compression that support computation over the data withou…
RePair in Compressed Space and Time
Kensuke Sakai, Tatsuya Ohno, Keisuke Goto +3
Given a string of length , the goal of grammar compression is to construct a small context-free grammar generating only . Among existing grammar compression methods, RePa…