Binary Tree Traversal

TFIDF

n-grams

Binary bag of words

Term Frequency Inverse Document Frequency

True Form Indexed Document Features

Token Format Indexed Data Frequency

Text Filter Inverted Data Formula

To convert all words to lowercase

To replace rare words with more common synonyms

To remove punctuation marks from the text

To remove words that are considered unimportant for analysis

To assign weights to terms based on their importance in a document corpus

To identify named entities in a document

To measure the frequency of terms in a document

To normalise term frequencies in a document

To identify the language of a text

To determine the topic of a text

To transform words into their base or root form

To extract named entities from text

They are simple to implement

They are also called incremental learners

They are efficient in terms of computation time.

They scale well to large data sets