Small, focused full-text indexing and search for any JavaScript application
npm install txitxitxi minimizes false positives and false negatives by using a scoring mechanism that takes into account stems, misspellings, trigrams, and disemvoweled versions of words. This can be tuned to reduce memory usage if desired.
javascript
const txi = Txi();
await txi.index("text1","This has a lot of stop words in it that will be ignored as content");
await txi.index("text2","However, the storage of meanigful content is far more interesting.");
await txi.index("object1",{name:"joe",address:{city:"Seattle",state:"WA"}});
await txi.index("text3","Go Seattle Sea Hawks!");
console.log(await txi.search("Seatle")); // note the typo, it will still be found
console.log(await txi.search("Seattle"));
console.log(await txi.search("meanigful content"));
`
will print the below for the commented search strings
`javascript
[ { id: 'text3', // Seatle
score: 4,
count: 2,
stems: { seatl: 1 },
trigrams: { sea: 1, eat: 0.5 },
compressions: { stl: 1.5 },
booleans: {},
numbers: {} },
{ id: 'object1',
score: 3.5,
count: 2,
stems: { seatl: 1 },
trigrams: { sea: 0.5, eat: 0.5 },
compressions: { stl: 1.5 },
booleans: {},
numbers: {} } ]
[ { id: 'text3', // Seattle
score: 5,
count: 2,
stems: { seattl: 1 },
trigrams: { sea: 1, eat: 0.5, att: 0.5, ttl: 0.5 },
compressions: { stl: 1.5 },
booleans: {},
numbers: {} },
{ id: 'object1',
score: 4.5,
count: 2,
stems: { seattl: 1 },
trigrams: { sea: 0.5, eat: 0.5, att: 0.5, ttl: 0.5 },
compressions: { stl: 1.5 },
booleans: {},
numbers: {} } ]
[ { id: 'text2', // meanigful content
score: 10.25,
count: 4,
stems: { meanig: 1, content: 1 },
trigrams:
{ mea: 0.5,
ean: 0.5,
ani: 0.5,
nig: 0.5,
igc: 0.5,
gco: 0.5,
con: 0.5,
ont: 0.5,
nte: 1,
ten: 0.5,
ent: 0.5 },
compressions: { mng: 0.75, cntnt: 1.5 },
booleans: {},
numbers: {} },
{ id: 'text1',
score: 5,
count: 2,
stems: { content: 1 },
trigrams: { con: 0.5, ont: 0.5, nte: 0.5, ten: 0.5, ent: 0.5 },
compressions: { cntnt: 1.5 },
booleans: {},
numbers: {} } ]
`
API
$3
Txi({Array stops,boolean stems=true,boolean trigrams=true,boolean compressions=true,boolean misspellings=true,storage={get,set,count,keys})
Creates a Txi text indexer with default settings.
The boolean flags indicate which features of txi to turn on. See Managing Memory and Accuracy for more details.
The storage option should be provided methods get(key), set(key,value), count() and keys() which will be used to automatically save index fragments to a key/value store like localStorage or Redis. If the storage option is provided, txi uses far less RAM because no in memory index is mainatined. If you need caching, implement it within your get and set functions.
Using new is not required.
Array stops - Replaces the array of stop words, i.e. words that are not added to the index. To just add words use the instance function addStops.
$3
Adds the provided words to the internal stops words. Returns the Txi instance.
$3
As items are deleted from the index, keys may end-up without id entries. This removes those keys. They are not removed as items are removed because checking to see if there are remaining ids on a key can be expensive. Returns the Txi instance.
$3
Returns a copy of the internal index data structure. See Index Structure below for more details. Throws an error if the Txi instance was started with a storage option.
$3
Adds the data to the index and stores id to return when a search matches the data. Returns a Promise for the Txi instance.
$3
Returns an object of the form:
`javascript
{[: true[,...]]}
`
For example:
`javascript
{
march: true,
mar: true,
arc: true,
rch: true
}
`
This function is provide for efficiency. Although the data structure is slightly larger than an array, it can be maintained in a very efficient manner internally and does not require the creation of an array by calling Object.keys(index) every time a list of keys is needed.
WARNING: For efficiency, the actual internal txi data structure is returned. DO NOT modify it.
$3
This function is provided for efficiency. Returns a Promise for the current number of keys.
$3
Uses initialValues to initialize an internal in-memory index. Returns the Txi instance. See Index Structure below to understand initialValues better.
$3
Setting the property onchange to callback causes callback to be invoked with all the index changes made every time index is called. The callback receives an argument that has the same structure as an index. It is provided so that the program using txi can store the index updates. Typically, an asynchronous callback should be used to ensure high performance. See Index Structure and Updating an Index below for more details.
$3
Removes the id and its index values from a Txi instance. No-op if the id does not exist. Returns the a Promise for the instance.
$3
Removes the words provided from the words that are not indexed. Returns the Txi instance.
$3
Search the index using the criteria and return a Promise for an sorted array of potential matches. The options default to those values provided during creation of the instance. The options flag is used to control memory useage and the return of false positives or negatives. See the section Managing Memory and Accuracy below.
In addition to the txi start-up options, the options object can also take the boolean property all. When an object is the search criteria every top level property on the object must be matched. When a string is the search criteria, then the key count for each of the index types accessed (stems, trigrams, compressions) must be greater than 0.
There is a special property value _*_. If this value is present, then Txi will simply return all objects that contain the property and not attempt to match the value against booleans, numbers, stems, trigrams, or disemvowels.
A potentialMatch has the form:
`javascript
{ id: string||number
score: number,
count: number,
stems: {
[: number[,...]] // number of times stem occured in item identified by id
},
trigrams: {
[: number[,...]] // number of times trigram occured in item identified by id
},
compressions: {
[: number[,...]] // number of times compression occured in item identified by id
},
numbers: {
[: number[,...]] // number of times number occured in item identified by id
},
booleans: {
[: number[,...]] // number of times boolean occured in item identified by id
}
}
`
For example:
Assume the file 404.html contains the string "Not Found".
A search for "found" returns a single element array like this:
`javascript
[ { id: 404,
score: 3.25,
count: 2,
stems: { found: 1 },
trigrams: { fou: 0.5, oun: 0.5, und: 0.5 },
compressions: { fnd: 0.75 },
numbers: {},
booleans: {} } ]
`
A search for "not found" returns a single element array like this:
`javascript
[ { id: 404,
score: 8,
count: 5,
stems: { not: 2, found: 1 },
trigrams: { not: 1, otf: 0.5, tfo: 0.5, fou: 0.5, oun: 0.5, und: 0.5 },
compressions: { nt: 0.75, fnd: 0.75 },
numbers: {},
booleans: {} } ]
`
Index Creation Internals
Txi creates an index by tokenizing a string and using the stems of non-stop words, the likely misspellings of stems, disemvoweled stems, trigrams of all the stems concatenated together, and tokens than can be numbers or booleans to create a data structure that keeps track of what items are associated with ids passed in during the index process along with their frequency of occurence. See Index Structure below.
Txi searches an index by tokenizing a string and using the stems of non-stop words, the likely misspellings of stems, disemvoweled stems, trigrams of all the stems concatenated together, and tokens than can be numbers or booleans to look for matches in the index. The total frequency of each item matched item is summed for the match type, e.g. stems are summed separate from trigrams. The sum of all of these is a score for which a higher value indicates a more likely match. Most searches return more than one result and are sorted in a descending manner by score.
Possible misspellings are generated during indexing and added to the index. This is done because reversing out search misspellings would require a large dictionary. Misspellings are generated through the use of patterns identified by the Oxford Dictionary.
An additional reason for indexing misspellings is that searches may include atomic typos. These would be impossible to reverse without doing a full semantic and syntactic analysis of the search.
The most likely impact of misspellings is false positives during search, particularly due to trigram changes. However, by default txi uses a scoring algorithm across multiple indexable features, i.e. stems, trigrams, disemvoweled stems, and misspellings. Hence, false positives will generally have a lower score and be later in the search results.
A statistical analysis of the effectiveness of txi scoring would be interesting, but is beyond the capacity of the package author at this time.
$3
`javascript
{[:{:{stems:,trigrams:,compressions:,numbers:,booleans:}}[,...]}
`
The txi index structure is a JavaScript object the property keys of which are characterSequences that contain objects with property keys that point to the item indexed. The characteSequences could be any or all of a stem, a trigram, a compression, a number, or a boolean. The values stored on the ids are the frequency the sequence appears in the item indexed. Storing the item indexed is beyond the scope of txi, it just keeps track of ids, the calling program must keep track of the content itself. A common index id is a URL to a web page.
Below is an annotated index for "In March, the solidiers marched in solidarity with the peasants against the rich". Don't worry that it looks so big. There are only 17,526 possible 3 letter combinations. JavaScript engines can handle key look-ups on an object this size quite well. And, over time the index will not grow as quickly. The big load comes from stems. See Managing Memory and Accuracy for more detail.
`
{ // the word "march" shows up twice, albeit with different meanings
march: { text1: { stems: 2, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
// "solidi" is a stem of the misspelling of "soldiers" as "solidiers"
solidi: { text1: { stems: 1, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
// "solidar" is a stem of "solidarity"
solidar: { text1: { stems: 1, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
peasant: { text1: { stems: 1, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
against: { text1: { stems: 1, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
rich: { text1: { stems: 1, trigrams: 0, compressions: 0, numbers: 0, booleans: 0 } },
mrch: { text1: { stems: 0, trigrams: 0, compressions: 2 } },
// "sld" is a compression of the stem of "solidarity"
sld: { text1: { stems: 0, trigrams: 0, compressions: 1 } },
sldr: { text1: { stems: 0, trigrams: 0, compressions: 1 } },
psnt: { text1: { stems: 0, trigrams: 0, compressions: 1 } },
gnst: { text1: { stems: 0, trigrams: 0, compressions: 1 } },
// "rch" is a trigram in "march", which shows-up twice
// "rch" is also a compression for "rich", which shows-up once
rch: { text1: { stems: 0, trigrams: 2, compressions: 1 } },
// "rch" is a trigram in "march", which shows-up twice
mar: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
// "arc" is a trigram in "march", which shows-up twice
arc: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
// "chs" is a trigram in resulting from dropping " the " between "March" and "soldiers"
// it is also a trigram resulting from stemming and dropping the with "marched in solidarity"
chs: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
hso: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
// "sol" is a trigram in "solidarity" and "solidiers"
sol: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
// "oli" is a trigram in "solidarity" and "solidiers"
oli: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
// "lid" is a trigram in "solidarity" and "solidiers"
lid: { text1: { stems: 0, trigrams: 2, compressions: 0, numbers: 0, booleans: 0 } },
idi: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
dim: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ima: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ida: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
dar: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
arp: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
rpe: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
pea: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
eas: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
asa: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
san: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ant: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
nta: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
tag: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
aga: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
gai: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ain: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ins: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
nst: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
str: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
tri: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ric: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } },
ich: { text1: { stems: 0, trigrams: 1, compressions: 0, numbers: 0, booleans: 0 } } }
`
Storing and Restoring an Index
If a storage option is provided during initialization storing and restoring the index is automatic and far less RAM will be used by txi since no in memory index is required.
Alternatively, you can use an approach similar to that laid out below.
$3
The value returned by getIndex is a non-circular JavaScript object that can be safely stored by serializing with JSON.stringify.
For large indexes, you will need to walk the data structure and store components individually. This would typically be done by saving each key/value pair separately followed by all of the keys. For example:
`javascript
const txi = Txi();
txi.index("In March, the solidiers marched in solidarity with the peasants against the rich");
const index = txi.getIndex(),
keys = txi.getKeys(); // this is faster than Object.keys(index);
keys.forEach(key => {
setItem(key,JSON.stringify(index[key]));
});
setItem("myIndex",JSON.stringify(keys));
`
$3
`javascript
const keys = JSON.parse(localStorage.getItem("myIndex")),
index = {};
Object.keys(keys).forEach(key => {
index[key] = JSON.parse(localStorage.getItem(key));
});
const txi = Txi();
txi.setIndex(index);
`
Updating an Index
If you set onupdate on a txi instance to a callback, then every time something is changed in an index, the callback will get invoked with an index fragment representing the changes. You can then walk the object and update your index storage, e.g.:
`javascript
const txi = Txi();
txi.onchange = fragment => {
Object.keys(fragment).forEach(key => {
localStorage.setItem(key,JSON.stringify(fragment[key]));
});
localStorage.setItem("myIndex",JSON.stringify(txi.getKeys()));
}
`
Managing Memory and Accuracy
Use the following table to assist in reducing memory usage by a txi index. Try doing each thing in order. In all cases, false negatives may increase.
| Reduce Memory Usage | Reduce False Positives |
|---------------------|------------------------|
| misspellings=false | trigrams=false |
| stems=false | |
| compressions=false | |
| trigrams=false | |
Turning off everything except trigrams is very memory efficient because there are a finite number of 3 letter combinations, and even some of these are cast off as stop words. However, trigrams can return a lot of false positives if used alone. Adding compressions back in can make a huge difference.
Obvioulsy, if you turn everything off including trigrams, you will have an empty index and be unable to retrieve any results!
Note, if you are indexing or searching JavaScript objects with stems turned off, stems may show up in the results because property names with a colon appended are used as stem index keys.
Terminology
atomic typo - An atomic typo occurs when the modification of one character in a string results in a word with a different meaning. Although none of the following match common misspelling patterns, examples of atomic typos include "war", instead of "was"; "bite", instead of "byte"; "massage", instead of "message"; "forman" instead of either "for man" or "foreman". Since the alternate word is actually a word, determining if its presence is a typographical error is not possible without a deep syntactic or semantic analysis.
disemvowel - To remove vowels from a word to make it shorter, but in most cases still understandable.
stem - To remove common endings from words where such endings are unlikely to impact search results. Removing the tense of a verb is a stemming operation, e.g. "I will call you" vs "I called you".
tokenize - To remove all punctuation and return an array of words that were separated by spaces.
trigram - The series of all three letter character sequences in a string that has punctuation and spaces removed.
Updates (reverse chronological order)
2021-02-31 v0.0.7b Updated dependencies. Removed 'dist' directory since it was just a copy of index.js
2019-02-01 v0.0.6b Added the _*_ property wildcard. Optimized stem usage when stems=false` and objects are indexed. Documentation updates.