An expression (57 passages, no note) of one to four words that the keyword discovery (3 passages, no note) kept because it recurs without a note: at least three occurrences in two distinct files, neither starting nor ending with a stopword, not made only of digits (4 passages, no note), not shorter than three characters (16 passages, no note), absent from the dictionary and from the rejected terms (4 passages, no note) of the lock. Each candidate (note: Candidate) is scored by its C-value (35 passages, no note) times its inverse document (note: Document) frequency; from inference.candidate_score, 4.0 by default, it yields W-TERM-UNDEFINED, and above the publication threshold it gets a keyword page. The candidates are listed under candidates.terms of the model with their score (note: Confidence), counts and contexts (note: Passage).
Candidate expression
Properties3
- Application
- Concordance command line
- Domain
- Recognition
- Status
- valid
3 declared keys. The rest of the file is free text.
See the neighbourhood map6 pages6Neighbourhood mapCandidate expression
Neighbourhood map Candidate expression
Distance1 hop
81 neighbours in total, more than the map shows.
The 6 neighbourstextual equivalent
- InferenceTermgeneralizes1
- ModelTermspecializes7
- Comparison formTermspecializes5
- DictionaryTermspecializes7
- KeywordTermspecializes16
- OccurrenceTermspecializes5
Six neighbours at most, always named. Beyond that the map teaches nothing: the list takes over.