First-order logic and star-free sets
Journal of Computer and System Sciences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Theoretical Computer Science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Statistical methods for speech recognition
Statistical methods for speech recognition
Learning k-piecewise testable languages from positive data
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
The rôle of natural language processing in alternative and augmentative communication
Natural Language Engineering
Probabilistic Finite-State Machines-Part II
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Finite-State Machines-Part I
IEEE Transactions on Pattern Analysis and Machine Intelligence
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
Kernel methods for learning languages
Theoretical Computer Science
Grammatical Inference: Learning Automata and Grammars
Grammatical Inference: Learning Automata and Grammars
On languages piecewise testable in the strict sense
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Aural Pattern Recognition Experiments and the Subregular Hierarchy
Journal of Logic, Language and Information
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Maximum likelihood estimation of feature-based distributions
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
| Hi-index | 0.00 |
Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classes in the Chomsky and Subregular hierarchies, there are many independently converging characterizations of the SP class (Rogers et al., to appear). Here we define SP distributions and show that they can be efficiently estimated from positive data.