Fast Approximate String Matching in a Dictionary¶

Baeza-Yates, R., & Navarro, G. (1998). Fast Approximate String Matching in a Dictionary. Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207), 14-22.

Type: Conference paper
Intellectual base: Primary research
Year: 1998
Pages: 14-22
DOI: 10.1109/spire.1998.712986
DOI registrant: Institute of Electrical and Electronics Engineers
Link: https://doi.org/10.1109/spire.1998.712986

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

BK-tree
- It does not promise logarithmic time, prescribe an implementation language, or characterize arbitrary similarity search.

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:aa3fa3286f43 · see in the full table