| |
Algorithm in short
|
The chief trait of the analysis algorithm is that the preference for the largest matches
in a lexicon is applied recursively in a binary decomposition of the input string;
input is scanned detractively: from the whole string to its parts. The binary analysis
trees are hypothesised in a breadth-first ordering, which guarantees that all
decompositions into the lowest number of components are always obtained first,
and that readings with more components need not be pursued at all. In order to
further enhance precision, the measurement of complexity of a reading is generalised
and translated onto a scale of weights representing the degree of lexicalization
of a component.
|
