# Exact Record Link Candidates

Build-time release reference. Runtime readiness, deployment, payment settlement and external indexing are not evaluated here. Prices are proposed; this file cannot authorize execution or payment.

Produce every admissible cross-table candidate using explicitly normalized Unicode-scalar Levenshtein distances and exact integer weighted costs. Includes all tied best candidates; never selects an identity, asserts duplicates or merges records.

Release: 0.29.0. Built: 2026-10-06T15:38:00Z.

## Choose for
- Return a complete bounded candidate queue with exact field-distance evidence

## Outside this profile
- Identity resolution, true-duplicate assertions, automatic merging, confidence probabilities or semantic similarity
- Medical, employment, credit or other high-impact decisions about people
- Large-table nearest neighbors, top-k retrieval or transposition distance
- Network requests, file changes, external execution, publishing or deployment

Proposed nominal USD 0.006 per successful call; payer fees excluded. No verified runtime availability.

- [Exact release contract](/reference/services/records-link-candidates.json)
- [Input schema](/reference/schemas/records-link-candidates.input.json)
- [Output schema](/reference/schemas/records-link-candidates.output.json)
- [Fixed example](/reference/examples/records-link-candidates.json)
- [Complete HTML reference](/discover/tools/records-link-candidates)