Distributional learning of context-free and multiple context-free grammars
This chapter reviews recent progress in distributional learning in grammatical inference as
applied to learning context-free and multiple context-free grammars. We discuss the basic …
applied to learning context-free and multiple context-free grammars. We discuss the basic …
[HTML][HTML] Beyond operator-precedence grammars and languages
Abstract Operator Precedence Languages (OPL) are deterministic context-free and have
desirable properties. OPL are parallely parsable, and, when structurally compatible, are …
desirable properties. OPL are parallely parsable, and, when structurally compatible, are …
PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data
In recent years different interesting subclasses of cfl s have been found to be learnable by
techniques generically called distributional learning. The theoretical study on the exact …
techniques generically called distributional learning. The theoretical study on the exact …
[PDF][PDF] Local substitutability for sequence generalization
Genomic banks are fed continuously by large sets of DNA or RNA sequences coming from
high throughput machines. Protein annotation is a task of first importance with respect to …
high throughput machines. Protein annotation is a task of first importance with respect to …
The generalized smallest grammar problem
Abstract The Smallest Grammar Problem–the problem of finding the smallest context-free
grammar that generates exactly one given sequence–has never been successfully applied …
grammar that generates exactly one given sequence–has never been successfully applied …
[HTML][HTML] Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
In recent years different interesting subclasses of cfl s have been found to be learnable by
techniques generically called distributional learning. The theoretical study on the exact …
techniques generically called distributional learning. The theoretical study on the exact …
[HTML][HTML] Toward a theory of input-driven locally parsable languages
If a context-free language enjoys the local parsability property then, no matter how the
source string is segmented, each segment can be parsed independently, and an efficient …
source string is segmented, each segment can be parsed independently, and an efficient …
Learnability
Reviews of learnability in linguistics focus on negative results, with the nativists stressing the
negative results and the researchers of a more empiricist persuasion downplaying them …
negative results and the researchers of a more empiricist persuasion downplaying them …
[PDF][PDF] Formal tree languages and their algorithmic learnability
A Kasprzik - 2012 - ubt.opus.hbz-nrw.de
This thesis centers on formal tree languages and on their learnability by algorithmic methods
in abstractions of several learning settings. After a general introduction (Chapter 1), we …
in abstractions of several learning settings. After a general introduction (Chapter 1), we …
Bounding the maximal parsing performance of Non-Terminally Separated grammars
Abstract Unambiguous Non-Terminally Separated (UNTS) grammars have good learnability
properties but are too restrictive to be used for natural language parsing. We present a …
properties but are too restrictive to be used for natural language parsing. We present a …