19 Oct
2020
19 Oct
'20
2:44 p.m.
On Fri, Oct 16, 2020, at 18:59, Dan Stromberg wrote:
The complexity of a language varies with the square of its feature count,
Says who? I'd assume the orthogonality and regularity of features matters at least as much if not more than the number of features, and providing a system like this would guarantee some degree of regularity. Is there some notion of "complexity of a language" [other than by trivially *defining* it as the square of the number of features] for which this can be shown to be true?