Skip to content

Main content

Ranking Shared Prefix Credit Term Tool

Compute ranking shared prefix credit term from explicit bounded inputs.

Loading tool…

Description

Take the first depth elements from each list, require each selected prefix unique, and return the number shared and credit=shared/depth.

A similarity term depends on the comparison universe, missing-value policy, treatment of repeated features, and normalization. A score can also have a caller-selected value when its mathematical denominator vanishes. Those conventions matter before interpreting a threshold or comparing methods.

Take the first depth elements from each list, require each selected prefix unique, and return the number shared and credit=shared/depth.

When to use this tool

Use Ranking Shared Prefix Credit Term when you need this particular comparison term, normalization, domain condition, or empty-result policy in a larger matching workflow.

How to use the tool and how it works

  1. Enter left, right, depth. Keep parallel arrays aligned. Use the units and conventions below.
  2. Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
  3. Read shared, credit. Use the output convention below.

Take the first depth elements from each list, require each selected prefix unique, and return the number shared and credit=shared/depth. Require depth one through 256 fitting both lists.1

Input fieldMeaning and unitsAccepted input
leftLeftRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
rightRightRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
depthPositive prefix length, at most 256, within both lists.Required. Safe integer; minimum 1; maximum 256.
Output fieldInterpretationReturned shape
sharedSharedRequired. Safe integer.
creditCreditRequired. Finite number.
json
{
  "input": {
    "left": [
      "a",
      "b"
    ],
    "right": [
      "b",
      "c"
    ],
    "depth": 2
  },
  "output": {
    "shared": 1,
    "credit": 0.5
  }
}

Limitations and assumptions

  • Order within each prefix does not affect this set overlap. This is one depth's credit, not a complete ranking similarity or a position-by-position agreement score.
  • The field tables state structural bounds; the mechanics also specify cross-field constraints. Malformed inputs and unsupported domains cause errors. A successful false flag, empty branch value, or zero placeholder has the meaning stated above and is distinct from an input error.
  • Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Signed zero is exported as zero.

Alternative or Complementary methods

Compare methods only after aligning feature definitions, missingness, empty policies, multiplicities, and normalizers. Use a complete comparison when the tool returns only one contribution or count check.

References

  1. Calculation and input contract: similarity/ranking-shared-prefix-credit-term — tool.io

Similar or alternative tools