Fast Approximate Search in Large Dictionaries

Mihov, S., & Schulz, K. U. (2004). Fast Approximate Search in Large Dictionaries. Computational Linguistics, 30(4), 451-477.

Type

Journal article

Intellectual base

Primary research

Year

2004

DOI

10.1162/0891201042544938

Link

https://doi.org/10.1162/0891201042544938

Cited by

1 citation across 1 artifact.

Domain-specific

• BK-tree
  • … by its exact edit distance from book; later words recurse under the already existing equal-distance child. to A dictionary service searches for every stored token within edit distance two of a misspelling and returns all exact matches before ranking them by a separate language model. demonstrates that continuity.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:25d700207f7e · see in the full table