.levenshtein

Simple implementation for detecting near-matches.

internal

Provides diagnostic tools for understanding and debugging data frame
joins. Analyzes key columns before joining to detect duplicates, mismatches,
encoding issues, and other common problems. Explains unexpected row count
changes and provides safe join wrappers with cardinality enforcement. Concepts
and diagnostics build on tidy data principles as described in Wickham (2014)
<doi:10.18637/jss.v059.i10>.

Gilles Colling

joinspy

Diagnostic Tools for Data Frame Joins

.levenshtein function

<dl><dt>s1</dt>
<dd>First string.</dd>
<dt>s2</dt>
<dd>Second string.</dd></dl>

Arguments

Calculate 'Levenshtein' Distance — .levenshtein

<dl>

<dt>s1</dt>
<dd>First string.</dd>


<dt>s2</dt>
<dd>Second string.</dd>

</dl>

.levenshtein: Calculate 'Levenshtein' Distance

Description

Usage

Value

Arguments