Compute an exact line-by-line diff between two texts using a longest-common-subsequence algorithm. Returns per-line operations (equal/del/ins) with line numbers plus added/removed/unchanged counts. Exact and reproducible; refuses oversized input rather than hanging.

Compute a cryptographic hash of a UTF-8 string. Returns hex and base64 digests plus the UTF-8 byte length. Supports sha256 (default), sha512, sha1, md5, and HMAC variants via hmacKey. Use for content fingerprints, deduplication and integrity checks.

Check whether a string is valid JSON. On failure returns the parser message plus the computed line and column of the error. On success returns the top-level shape. Distinguishes valid-but-empty-object from invalid.

Extract a value from a JSON document by path, e.g. "a.b[0].c" or "$.items[3].name". Reports resolved (did the path reach a location) separately from found (is the value non-null), so absent is distinguishable from present-but-null. Failure types are specific: missing-key, out-of-range, not-an-array, not-an-object.

Resolve several paths against one JSON document in a single call. Cheaper than issuing many json_query calls when you need multiple fields.

Exact text statistics: Unicode code points, UTF-8 bytes, lines, non-empty lines, words, sentences, paragraphs, unique words, average word length and most frequent words. Word segmentation is Unicode-aware so non-Latin scripts are counted correctly. Use whenever a count must be exact.

Interval between two ISO-8601 dates in days, weeks, months, years, hours, minutes, seconds or businessDays (Mon-Fri). Months and years use true calendar arithmetic, not 30/365-day approximations. All math is UTC.

Offset an ISO-8601 date by days, weeks, months, years, hours, minutes or seconds. Negative amounts subtract. Calendar-correct across month ends and leap years.

Apply a regular expression and return every match with its index, numbered capture groups and named groups. Iteration and match counts are hard-capped so a pathological pattern cannot hang the host. The response includes a ReDoS risk assessment of the pattern.

Statically analyse a regular expression for catastrophic backtracking (ReDoS): nested quantifiers, overlapping alternation inside repeated groups, backreferences under quantifiers, excessive wildcards. Returns a risk level and the specific reasons. The pattern is not executed.

Score every candidate string against a query using the Sorensen-Dice coefficient over character bigrams and return the best matches in descending order. Deterministic. Useful for deduplication, record linkage, typo-tolerant lookup and confirming which of several candidates was meant.

Sorensen-Dice similarity of two strings, from 0 (no shared character bigrams) to 1 (identical). One deterministic comparison.

Parse delimited text into a header plus rows, handling quoted fields, escaped quotes, embedded delimiters and embedded newlines (RFC 4180 style). If no delimiter is given, the most frequent candidate on the first line is chosen and reported back. Use instead of splitting on commas, which breaks on any real CSV.

Convert a value between units of length, mass, time or data size. Cross-family conversions are rejected rather than silently producing nonsense. Data sizes: kb/mb/gb are decimal (1000), kib/mib/gib are binary (1024). Supported units: m, km, cm, mm, mi, yd, ft, in, nmi, kg, g, mg, t, lb, oz, s, min, h, d, b, kb, mb, gb, kib, mib, gib.

Convert an integer string between bases 2 and 36 with arbitrary precision. Uses big-integer parsing, so values beyond IEEE-754 double precision (2^53) stay exact, which is exactly where naive conversion goes wrong. A leading 0b/0x/0o prefix is ignored.