We're going to build ourselves a binary classifier. Looks at a period.

So this, this intuition that we can build a classifier, we can derive features that are good predictors of whether a period is acting as an end of sentence or not, and then we can put these features into any kind of classifier, hold for, whatever classifier we're going to be using.

So what we need to do, to solve the period problem is build ourselves a classifier.

The simplest kind of classifier for this is a decision tree. So here's a simple decision tree for deciding.

And to make this classifier, we could use handwritten rules, we could use regular expressions, we could build machine learning classifiers.

Depending on the level of resource recovery, material can be put through an air classifier which separates light organic material from heavy organic material.

In the first half of 2004, 2036 calls from problematic families were registered ( problematic family is a classifier used in the police database POLIS).

The classifier files for KADMOS could not be found. OCR with KADMOS will not be possible! Change the OCR engine in the preferences dialog.

Nonetheless the questions in a decision tree, we can think of them as the kind of features that could be exploited by any other classifier, whether it's linguistic regression or SVMs or neural nets, some of the classifiers we'll talk about later.