no code implementations • 12 Mar 2024 • Yunze Wei, Tianshuo Hu, Cong Liang, Yong Cui
The past few years have witnessed the flourishing of large-scale deep neural network models with ever-growing parameter numbers.
no code implementations • 11 Jul 2022 • Alan J. X. Guo, Cong Liang, Qing-Hu Hou
The Levenshtein distance is approximated by the squared Euclidean distance between the embedding vectors, which is fast calculated and clustering algorithm friendly.