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

Volume

30

Issue

4

Pages

451-477

DOI

10.1162/0891201042544938

DOI registrant

MIT Press

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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