The principle of semantic accountability claims that a good grammar should be able to say “something explicit about how the abstractions of the grammar match with actual meaning”

lower things into LLVM IR, HLO, etc. — “analyze the sentences”

• check type
• catch inconsistency
• scoping rules, etc.

Typical, we implement multiple passes for this because optimizing for multiple passes is quite hard. We need this because most grammars are not actually context free (for instance, scoping).

what to check

1. declaration of identifiers
2. types
3. inheritance relationships
4. class efined once
5. methods in a class defined only once
6. reserved identifiers are not misused (i.e., inherits, etc.)

example

type errors

let y: String <- "abc" in y+3

variables that don’t exist

let y : Int in x + 3

scope

the scope of an identifier is the portion of a program in which a particular identifier is accessible.

Represent health information in terms of rule-based ontologies.

In NSM, semantic primes are the most fundimental “lexical units” (so they can be words, or morphemes, etc. the size doesn’t matter) across languages.

They are the “core of a universal mental lexicon”.

There are…

guidelines for identifying semantic primes

1. A semantic prime has to be found in every(ish?) natural language
2. A semantic prime has to be indefinable by other primes

proof for the existence of semantic primes

Proof: given if the Strong Lexicalization Hypothesis holds, semantic primes must exist.

SVF is a standardized Discourse-Completion Task for verbal recall and fluency. It is administered by asking the participant to recall a bunch of words from within a category within 60 seconds.