Massive Text Normalization via an Efficient Randomized Algorithm-Reference-Cited by-同舟云学术

Massive Text Normalization via an Efficient Randomized Algorithm

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Jiang Nan¹,Luo Chen²,Lakshman Vihan²,Dattatreya Yesh²,Xue Yexiang¹

Affiliation:

1. Purdue University, Purdue University, USA

2. Amazon Search, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3485447.3512015

Reference57 articles.

1. The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

2. Experience: Insights into the Benchmarking Data of Hunspell and Aspell Spell Checkers;Al-Hussaini Leena;ACM J. Data Inf. Qual.,2017

3. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

4. Mark Aronoff . 1994. Morphology by itself: Stems and inflectional classes. Number 22 . MIT press . Mark Aronoff. 1994. Morphology by itself: Stems and inflectional classes. Number 22. MIT press.

5. AiTi Aw , Min Zhang , Juan Xiao , and Jian Su. 2006. A Phrase-Based Statistical Model for SMS Text Normalization . In ACL. The Association for Computer Linguistics . AiTi Aw, Min Zhang, Juan Xiao, and Jian Su. 2006. A Phrase-Based Statistical Model for SMS Text Normalization. In ACL. The Association for Computer Linguistics.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Language Identification and Normalization Techniques for Code-Mixed Text;2024 Sixth International Conference on Computational Intelligence and Communication Technologies (CCICT);2024-04-19