Levenshtein Edit Distance in PHP

<?php
declare(strict_types=1);
// Levenshtein Edit Distance in PHP
//
// PURPOSE
// Edit distance counts the minimum unit-cost insertions, deletions, and substitutions needed
// to turn one token sequence into another.
//
// METHOD
// Retain one row and the previous diagonal. Equal tokens keep the diagonal distance.
// Different tokens add one to the cheapest deletion, insertion, or substitution.
//
// COMPLEXITY
// O(nm) time and O(min(n,m)) auxiliary space. The public function automatically orients the
// shorter input as its work row.
//
// CONTRACT
// Inputs are integer tokens. For text, tokenize consistently before calling; Unicode
// normalization and grapheme rules are separate concerns. Returns distance only.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// PHP 8.1+ on a 64-bit runtime: packed arrays, strict scalar types, read-only inputs by
// value using copy-on-write, references only for outputs, and checked 32-bit arithmetic.
// Invalid input and overflow throw exceptions. PHP arrays have higher overhead than native
// packed buffers in C/Java.
//
// EXAMPLE
// Expected return: 2.
// Run: php example.php
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(bool $valid): void { if (!$valid) throw new InvalidArgumentException("invalid algorithm input"); }
function alg_checked(int|float $v): int { if ($v < -2147483648 || $v > 2147483647 || floor($v) != $v) throw new OverflowException("32-bit result overflow"); return (int)$v; }
function alg_add(int $a,int $b): int { return alg_checked($a+$b); }
function alg_sub(int $a,int $b): int { return alg_checked($a-$b); }
function alg_mul(int $a,int $b): int { return alg_checked($a*$b); }
function alg_size(int $n): int { alg_require($n>=0 && $n<=4000000); return $n; }

function edit_distance(array $a, array $b): int {
    alg_require(array_is_list($a));
    alg_require(array_is_list($b));
    $n = count($a);
    $m = count($b);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((($m >= 0) && ($m <= 1000000)));
    alg_require((count($a) == $n));
    alg_require((count($b) == $m));
    if ($n < $m) return edit_distance($b, $a);
    $dp = array_fill(0, alg_size(alg_add($m, 1)), 0);
    $i = 0;
    $j = 0;
    $diagonal = 0;
    $old = 0;
    while (($j <= $m)) {
        $dp[$j] = $j;
        $j = alg_add($j, 1);
    }
    while (($i < $n)) {
        $diagonal = $dp[0];
        $dp[0] = alg_add($i, 1);
        $j = 1;
        while (($j <= $m)) {
            $old = $dp[$j];
            if (($a[$i] == $b[alg_sub($j, 1)])) {
                $dp[$j] = $diagonal;
            } else {
                $dp[$j] = alg_add(1, min($dp[$j], min($dp[alg_sub($j, 1)], $diagonal)));
            }
            $diagonal = $old;
            $j = alg_add($j, 1);
        }
        $i = alg_add($i, 1);
    }
    return $dp[$m];
}

$a = [1, 2, 3];
$b = [1, 4, 3, 5];
$result = edit_distance($a, $b);
echo $result, PHP_EOL;