fftrees_wordstofftrees

<code>fftrees_wordstofftrees</code> converts a verbal description
of an FFT (provided as a text string) into a tree definition (of an <code>FFTrees</code> object).
<code>fftrees_wordstofftrees</code> is the complement function to
<code>fftrees_ffttowords</code>, which converts a tree definition
(of an <code>FFTrees</code> object) into a verbal description.
To increase robustness, the parsing of <code>fftrees_wordstofftrees</code>
allows for lower- or uppercase spellings (but not typographical variants)
and ignores the else-part of the final sentence (i.e., the part
beginning with "otherwise").

Create, visualize, and test fast-and-frugal decision trees (FFTs) using the algorithms and methods described in Phillips, Neth, Woike & Gaissmaier (2017).
FFTs are simple and transparent decision trees for solving binary classification problems.
FFTs can be preferable to more complex algorithms because they require very little information, are easy to communicate, and are robust against overfitting.

Hansjoerg Neth

FFTrees

Generate, Visualise, and Evaluate Fast-and-Frugal Decision Trees

Nathaniel Phillips

Jan Woike

Wolfgang Gaissmaier

fftrees_wordstofftrees function

<dl><dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>
<dt>my.tree</dt>
<dd>string. A verbal string defining an FFT.</dd></dl>

Arguments

Convert a text description of an FFT into an FFTrees object — fftrees_wordstofftrees

<dl>

<dt>x</dt>
<dd>An <code>FFTrees</code> object.</dd>


<dt>my.tree</dt>
<dd>string. A verbal string defining an FFT.</dd>

</dl>

fftrees_wordstofftrees: Convert a text description of an FFT into an `FFTrees` object

Description

Usage

Value

Arguments

See Also