startthat.work home

PE-07 Collocation and n-gram extraction (phrase detection; association measures)

Find word sequences that occur together more often than chance, giving ranked phrases with association scores as a feature set.

Prepare and extractEvidence: DocumentedPreparation technique, runs in step 5.2Strongest statement: describe

What it does

Finds word sequences that occur together more often than chance. Artefact: ranked phrases with association scores. Read recurring named concepts, fixed expressions and repeated boilerplate.

When to use it

Use when you need to find multi-word terms and fixed expressions before dictionary or topic work.

When it does not fit

Use to find multi-word terms before dictionary or topic work. Boilerplate and repeated headers produce top-ranked phrases. A low default minimum count means rare sequences are scored.

Result format

The result is a ranked list of phrases with an association score for each. It names the recurring concepts, fixed expressions and repeated boilerplate among them.

Requirements on the material

PropertyRequirement typeRequirement
StructureApplies in some casesrequires=unstructured; requires=semi-structured
Content typeAlways appliesrequires=text
Unit of analysisAlways appliesrequires=document
Appraises source credibilityApplies in some casesno

Not restricted on: Variable types, Time structure, How the sample was chosen, Level of detail available, Number of sources, Whether sources can be joined, Amount of material, Known data problems, Producer interest, Source dependence, Origin, Document genre, Language, Personal information, Security classification, Licence.

Minimum materialA minimum phrase count set above the default of 2 for the size of the corpus.
Additional sources needednone
Not for (rules)none
Not for (text)Repeated headers and boilerplate have not been removed, so they would rank as the top phrases.

Choosing and ordering

Kind of techniquePreparation technique, runs in step 5.2
Phase tagverify and prepare
Other phase tagsanalyse
Kind of findingpattern
Question answeredwhat
Strongest statement it supportsdescribe
Needs as input
Makes as output
Must exist firstNone
Loop targetreturn to verify and prepare

Library checks by stakes

Each stakes level includes the checks of the level below it. Checks that need a person apply at high stakes only, so the process leaves them out at lower stakes (decision 38). Repeatability: deterministic.

StakesCheckPerson involvedCounts as a different method
exploratoryinput validationnoneno
decision-informinginput validationnoneno
decision-informingspot checkoptionalno
decision-informingsensitivity analysisnoneno
high-stakesinput validationnoneno
high-stakesspot checkoptionalno
high-stakessensitivity analysisnoneno
high-stakeshuman review sampleneededno
high-stakesindependent reviewneededno

Failure modes and limits

Model suitabilitymodel plus code
Typical model failureReports boilerplate and repeated headers as recurring concepts.
Error sourcesinput data; data transformation; statistical assumptions
Certainty limitsCertainty drops when the minimum count is low so rare sequences are scored (imprecision) or when boilerplate remains (risk of bias).

Evidence and tag basis

Documented. In quanteda the score is a lambda statistic with a Wald z value, the default minimum count is 2 and the default size is 2. (quanteda textstat_collocations)

Tag basis: input profile inference; selection inference; sequencing inference; robustness inference. All tag values are inference unless a source is named.