Introduction to Information Retrieval Study Notes (3) Word Dictionary and fault-tolerant Retrieval

Introduction to Information Retrieval Study Notes (iii) Word Dictionary and fault-tolerant retrieval 1. Data Structure of dictionary search

Hash Table Method

The query speed is fast, but the prefix query cannot be processed

Search Tree

Pay attention to the balance of the Search Tree

2. wildcard Query

(1)

Reverse B-tree

The wildcard character does not appear at the end and appears at the starting position.

Combined with B-tree and reverse B-tree

Wildcard in the middle

(2)

Rotation Index

The wildcard can be queried in the middle, but the dictionary will become larger.

K-gram Index

3. Spelling correction

(1) Editing distance

(2) K-gram Index

4. Pronunciation-based correction