Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
20250226 NLP colloquium: "SoftMatcha: 10億単語規模コー...
Search
Sponsored
·
Your Podcast. Everywhere. Effortlessly.
Share. Educate. Inspire. Entertain. You do you. We'll handle the rest.
→
Hiroyuki Deguchi
February 26, 2025
Research
850
1
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
20250226 NLP colloquium: "SoftMatcha: 10億単語規模コーパス検索のための柔らかくも高速なパターンマッチャー"
Hiroyuki Deguchi
February 26, 2025
More Decks by Hiroyuki Deguchi
See All by Hiroyuki Deguchi
20260427 Ehime DS Seminar: MBR-CBDT Decoding
de9uch1
1
44
20260624 NLP colloquium: 単一のhubテキストがCLIPを壊す:hubnessによる埋め込みの脆弱性特定
de9uch1
2
280
20240820: Minimum Bayes Risk Decoding for High-Quality Text Generation Beyond High-Probability Text
de9uch1
0
380
サブセット探索を用いた高速なkNNニューラル機械翻訳
de9uch1
0
180
20240226_AAMT-Japio
de9uch1
0
210
Searching for Needles in a Haystack: On the Role of Incidental Bilingualism in PaLM’s Translation Capability
de9uch1
0
180
Paper Reading: Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translation
de9uch1
0
240
My Research Environmental Setup
de9uch1
0
350
Nearest Neighbor Machine Translation
de9uch1
0
300
Other Decks in Research
See All in Research
[ACL 2026 Demo] Fast-MIA: Efficient and Scalable Membership Inference for LLMs
upura
0
130
Research Engineerという仕事 / Research Engineering: Bridging Research and Business
chck
1
360
量子サマースクール2026「量子計算機アーキテクチャ分野の概観」
youten622
1
940
[最先端NLP勉強会2026] Agentic Rubrics as Contextual Verifiers for SWE Agents
rfujii
1
370
【ローカルAIに向き合う展示会vol.2】液体時間定数型モジュールを用いた オリジナルの双方向エンコーダーモデルNexteraBERT 推論速度向上検討並びにダウンストリーム評価
rikkabotan7
0
220
HAKARI-Bench - 実運用視点での情報検索モデル評価ベンチマーク
hotchpotch
1
780
クラウド・AI 時代の研究開発 DX / R&D Digital Transformation
hariby
0
180
SOTAのさらに先へ:厳しい推論制約下での高性能モデルのPost-Training
analokmaus
0
1.6k
[最先端NLP勉強会2026] Checklists Are Better Than Reward Models For Aligning Language Models
nzw0301
1
320
Ghost in the 7‑Zip: The Shadow of Residential Proxies Creeping into Your Life
nttcom
0
2.1k
超効率化への挑戦:1bit LLMの現状と展望
yumaichikawa
0
770
全国町字単位空き家率推定データver1.0データ仕様
microbaseinc
0
270
Featured
See All Featured
AI Search: Where Are We & What Can We Do About It?
aleyda
0
8k
The Director’s Chair: Orchestrating AI for Truly Effective Learning
tmiket
1
310
技術選定の審美眼(2025年版) / Understanding the Spiral of Technologies 2025 edition
twada
PRO
120
120k
B2B Lead Gen: Tactics, Traps & Triumph
marketingsoph
0
250
Abbi's Birthday
coloredviolet
4
10k
KATA
mclloyd
PRO
35
16k
Skip the Path - Find Your Career Trail
mkilby
1
240
Primal Persuasion: How to Engage the Brain for Learning That Lasts
tmiket
0
490
Sharpening the Axe: The Primacy of Toolmaking
bcantrill
46
3k
Everyday Curiosity
cassininazir
0
330
A Modern Web Designer's Workflow
chriscoyier
699
190k
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
9
1.6k
Transcript
None
◼ ⚫ ⚫ ⚫ ⚫ ⚫ ◼ ⚫ ⚫ ⚫
◼ ◼ ◼ ◼
◼ ◼ ◼ ◼
◼ ◼ ◼ ◼
𝑤 ◼ 𝑤 ◼ ⚫ 𝑤 ⚫ 𝑤 ◼ ⚫
◼ ⚫ ◼ ⚫ ◼ ⚫ (Radovanovic+, JMLR2010) ⚫ ▶
Wang+, (arxiv) 2022, “Text Embeddings by Weakly-Supervised Contrastive Pre-training”. Radovanovic+, JMLR 2010, “Hubs in space: Popular nearest neighbors in high-dimensional data”.
◼ ◼ ◼ ◼
◼ ⚫ 𝐩 = 𝑝1 , … , 𝑝𝑀 ∈
Σ∗ ⚫ 𝐭 = 𝑡1 , … , 𝑡𝑁 ∈ Σ∗ ▶ Σ∗ ◼ ⚫ ⚫ ◼ ◼
◼ ⚫ 𝑤 ∈ 𝒱 𝐷 ⚫ 𝐯𝑤 ∈ ℝ𝐷
≔ 𝑤 ⚫ ▶ cos 𝐯person , 𝐯people > cos 𝐯person , 𝐯bird ▶
◼ ◼ ⚫ ※
◼ ⚫ 𝑡𝑖 = 𝑝𝑗 cos 𝐯𝑡𝑖 , 𝐯𝑝𝑗 ≥
𝛼 ▶ 𝛼 = 1.0 ※ 𝛼 = 0.7 ◼ ⚫ ⚫
𝑡1 𝑡2 𝑡3 𝑡4 𝑡5 𝑡6 𝑡7 𝑡8 𝑡9 𝑡10
𝑡11 𝑡12 𝑡13 ◼ ◼ ◼ ⚫
◼ 𝒮𝑤 ≔ 𝑣 ∈ 𝒱 cos 𝐯𝑣 ⊤𝐯𝑤 ≥
𝛼 ⚫ 𝑤 𝒮we 𝒮talk 𝒮about
⇔ 𝒮we , 𝒮talk , 𝒮about ⇔ 𝒮we , 𝒮talk
, 𝒮about 𝑖, 𝑖 + 1, 𝑖 + 2 𝑖 𝒮we 𝒮talk 𝒮about
𝒮we 𝒮talk 𝒮about 𝒮we ℳ ℳ ← 1,10,6 𝒮talk ℳ
ℳ′ ← 2 − 1, 11 − 1,7 − 1 = 1,10,6 ℳ ← ℳ ∩ ℳ′ = 1,10,6 𝒮about ℳ ℳ′ ← 8 − 2, 12 − 2 = 6,10 ℳ ← ℳ ∩ ℳ′ = 6,10 ℳ
𝒮we 𝒮talk 𝒮about 𝑡1 𝑡2 𝑡3 𝑡4 𝑡5 𝑡6 𝑡7
𝑡8 𝑡9 𝑡10 𝑡11 𝑡12 𝑡13
𝒮𝑝1 𝐼𝒮𝑝1 𝒮𝑝𝑀 𝐼𝒮𝑝𝑀 𝒮𝑝1 𝐼𝒮𝑝1 ℳ ℳ ← 𝐼𝒮𝑝1
𝑘 = 2, … , 𝑀 ℳ′ ← 𝑖 − 𝑘 + 1 𝑖 ∈ 𝐼𝒮𝑝𝑘 ℳ ← ℳ ∩ ℳ′ ℳ 𝐩 = 𝑝1 , … , 𝑝𝑀
◼ ⚫ ▶ ▶ ⚫
◼ ◼ ⚫ (Wang+, 2024) ⚫ (Douze+, 2024) (Malkov &
Yashunin, IEEE TPAMI, 2018) ◼ ⚫ ▶ 𝛼 = 0.55 (Pennington+, EMNLP2014) ▶ 𝛼 = 0.50 (Grave+, arXiv:1802.06893) Wang+, arXiv:2402.05672, “Multilingual E5 Text Embeddings: A Technical Report”. Douze+, arXiv:2401.08281, “The Faiss library”. Malkov & Yashunin, IEEE TPAMI, 2018, “Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs”. Pennington+, EMNLP2014, “GloVe: Global Vectors for Word Representation”. Grave+, arXiv:1802.06893, “Learning Word Vectors for 157 Languages”.
◼ ⚫ ▶ ⚫
◼ ⚫ ⚫ ◼ ⚫
◼ ⚫ (Crane, IJDL 2023) ⚫ (Bothwell+, EMNLP2023) ◼ Crane,
IJDL 2023, “The Perseus Digital Library and the future of libraries.”. Bothwell+, EMNLP2023, “Introducing Rhetorical Parallelism Detection: A New Task with Datasets, Metrics, and Baselines”.
◼ ⚫ ⚫ ⚫ ◼ ◼
◼ ⚫ ◼ ⚫ ▶ ◼ ⚫ ▶ ▶ ⚫
⚫
◼ ⚫ 𝐼𝒮𝑝𝑘 ▶ ⚫ ◼ ⚫
◼ ◼ ⚫ ⚫ ⚫ 𝑂 1 ▶ ◼ ⚫
⚫ ⚫ 𝑂 log |𝐵| ▶
◼ ⚫ ⚫ ◼ ⚫ ⚫ ▶ ⚫