Writing System Type Classifier (Alphabet/Abjad/Abugida/Logographic)

Classify independently documented segment/word/sign mapping and vowel representation evidence against caller script-type criteria, retaining mixed systems; not identity from Unicode block. Independently declared positive requirements, overlapping/unknown classes retained. Caller establishes language, dialect, method and reference context; no automatic identity or universal language-wide claim.

Description

Writing-system types describe how written signs represent language, such as sound units or larger linguistic units.

Writing-system types describe how written signs represent language, such as sound units or larger linguistic units.^[1]

Classification needs an explicit definition and observations of the system's operation. The tool compares your observed and known flags with your declared positive requirements, retaining unresolved candidates.

When to use Writing System Type Classifier (Alphabet/Abjad/Abugida/Logographic)

Use this tool to calculate or review the supplied observations under the stated rules. Specify the language variety, analysis, source edition and population or inventory definition.

How to use Writing System Type Classifier (Alphabet/Abjad/Abugida/Logographic) and understand its results

Specify the language variety, analysis, source edition and population or inventory definition.
Enter callerWritingSystemClassIds, callerWritingSystemRequirements, observedWritingSystemEvidence, knownWritingSystemFlags, using the field meanings and rules below, then run the tool.
Read compatibleCallerClasses, fullyWitnessedCallerClasses, using the output meanings and calculation rules below. Distinguish compatible candidates from fully witnessed classes; compatibility can retain unknown required evidence.
Correct any reported input issue and run again. Before using a successful result, check the stated units, signs, reference scope and observation coverage.

Input field	Meaning	Value type	Requirement
callerWritingSystemClassIds	Caller writing system class ids	list of string	Required
callerWritingSystemRequirements	Caller writing system requirements	numeric matrix	Required
observedWritingSystemEvidence	Observed writing system evidence	list of number	Required
knownWritingSystemFlags	Known writing system flags; binary 1 means the matched observation is known, 0 means unknown	list of number	Required

Use unique nonblank class IDs and a nonempty binary requirement matrix aligned by class and evidence column. Every class must require at least one positive feature. A one requires presence; zero ignores the feature and does not require absence. Supply binary observed evidence and known flags. A known required zero excludes a class; an unknown required feature retains compatibility but prevents full witnessing. Return all compatible classes and the subset with every required feature known and present. Classes may overlap.

compatible_c=∀j(requirement_cj=0 or known_j=0 or evidence_j=1); witnessed_c=∀j(requirement_cj=0 or (known_j=1 and evidence_j=1))

Use the matching field units and the exact boundary, ordering and reference rules above.

Output field	Meaning	Value type
compatibleCallerClasses	Compatible caller classes	list of string
fullyWitnessedCallerClasses	Fully witnessed caller classes	list of string

json

{
  "input": {
    "callerWritingSystemClassIds": [
      "a",
      "b"
    ],
    "callerWritingSystemRequirements": [
      [
        1,
        0
      ],
      [
        0,
        1
      ]
    ],
    "observedWritingSystemEvidence": [
      1,
      0
    ],
    "knownWritingSystemFlags": [
      1,
      0
    ]
  },
  "output": {
    "compatibleCallerClasses": [
      "a",
      "b"
    ],
    "fullyWitnessedCallerClasses": [
      "a"
    ]
  }
}

Limitations and assumptions

The language variety, analytical definitions and reference scope are supplied by the caller. No corpus, speech or complete/current linguistic registry is analyzed automatically. Compatible classes with unknown evidence are not positive identifications. Fully witnessed classes satisfy only the declared positive requirements.

Missing required fields, unknown fields, wrong types and violated rules return input issues. Numeric values and outputs must be finite. Lists and matrices must be dense, without missing cells. Numeric lists allow at most 10000 entries; ordinary string lists allow at most 128 strings of 128 UTF-16 units each; numeric matrices allow at most 128 rows and 128 columns, subject to narrower requirements above.

Alternative or Complementary methods

For a related step, use Unicode Block Range For Script Lookup: Unicode blocks are ranges of code points, while a script property classifies characters individually. For a complementary comparison, use Braille Grade 1 vs Grade 2 Diff Lookup: Uncontracted and contracted Braille differ in the use of code-defined contractions.

References

Writing System Type Classifier (Alphabet/Abjad/Abugida/Logographic) — tool.io

Similar or alternative tools

Unicode Block Range For Script Lookup
Unicode blocks are ranges of code points, while a script property classifies characters individually.
Braille Grade 1 vs Grade 2 Diff Lookup
Uncontracted and contracted Braille differ in the use of code-defined contractions.