prospectimo
v3.0.0
Published
Analyse the temporal orientation (time perspective) of a string.
Downloads
5
Maintainers
Readme
prospectimo
Get the temporal orientation (time perspective) of a string.
Usage
const prospectimo = require('prospectimo');
const opts = {
'encoding': 'binary',
'locale': 'US',
'logs': 3,
'max': Number.POSITIVE_INFINITY,
'min': Number.NEGATIVE_INFINITY,
'nGrams': 'true',
'output': 'lex',
'places': 9,
'sortBy': 'freq',
'wcGrams': 'false',
};
const str = 'A big long string of text...';
const prospection = prospectimo(str, opts);
console.log(prospection);
Default Ouput
By default, prospectimo will output an object with PAST, PRESENT, and FUTURE keys, and lexical values:
{
PAST: 1.56172642,
PRESENT: -1.341234123,
FUTURE: 0.123412234
}
The Options Object
The options object is optional and provides a number of controls to allow you to tailor the output to your needs. However, for general use it is recommended that all options are left to their defaults.
'encoding'
String - valid options: 'freq' (default), 'binary', or 'percent'
N.B - You probably don't want to change this, ever.
Controls how the lexical value is calculated.
Binary is simply the addition of lexical weights, i.e. word1 + word2 + word3.
Frequency encoding takes the overall wordcount and word frequency into account, i.e. (word frequency / word count) * weight.
Percent returns the percentage of token matches in each category as a decimal, i.e. 0.48 - 48%.
'output'
String - valid options: 'lex' (default), 'matches', 'orientation', or 'full'
'lex' (default) returns an object with the lexical value for past, present and future orientations.
'orientation' returns the predicted temporal orientation as a string, i.e. "Past", "Present", "Future", or "Unknown".
'matches' returns an array of matched words along with the number of times each word appears, its weight, and its final lexical value. See the output example below for an example.
'full' returns an object containing the lexical value and the matches array.
'nGrams'
Array - valid options: [ number, number, ...]
n-Grams are contiguous pieces of text, bi-grams being chunks of 2, tri-grams being chunks of 3, etc.
Use the nGrams option to include n-gram chunks. For example if you want to include both bi-grams and tri-grams, use like so:
{
nGrams: [2, 3]
}
If you only want to include tri-grams:
{
nGrams: [3]
}
'locale'
String - valid options: 'US' (default), 'GB' The lexicon data is in American English (US), if the string(s) you want to analyse are in British English set the locale option to 'GB'.
'logs'
Number - valid options: 0, 1, 2, 3 (default) Used to control console.log, console.warn, and console.error outputs.
- 0 = suppress all logs
- 1 = print errors only
- 2 = print errors and warnings
- 3 = print all console logs
'wcGrams'
String - valid options: 'true' or 'false' (default)
When set to true, the output from the nGrams option will be added to the word count.
For accuracy it is recommended that this is set to false.
'sortBy'
String - valid options: 'freq' (default)', 'weight', or 'lex'
If 'output' = 'matches', this option can be used to control how the outputted array is sorted.
'lex' sorts by final lexical value, i.e. (word frequency * word count) / word weight.
'weight' sorts the array by the matched words initial weight.
'freq' (default) sorts by word frequency, i.e. the most used words appear first.
'places'
Number
Number of decimal places to limit outputted values to.
The default is 9 decimal places.
'max' and 'min'
Float
Exclude words that have weights above the max threshold or below the min threshold.
By default these are set to infinity, ensuring that no words from the lexicon are excluded.
The smallest value in the lexicon is -0.9772179. Therefore a threshold of -0.98 will include all words in the lexicon.
The largest value in the lexicon is 1.15807005. Therefore a threshold of 1.16 will include no words in the lexicon.
Acknowledgements
References
Lexicon
Using the prospection lexicon data from WWBP under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported.
License
(C) 2017-18 P. Hughes. All rights reserved.
Shared under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported license.