scholarly journals On the efficient computation of single-bit input word length pipelined FFTs

2011 ◽  
Vol 8 (17) ◽  
pp. 1437-1443
Author(s):  
Saima Athar ◽  
Oscar Gustafsson ◽  
Fahad Qureshi ◽  
Izzet Kale
2019 ◽  
Vol 46 (6) ◽  
pp. 1169-1201
Author(s):  
Andrew CAINES ◽  
Emma ALTMANN-RICHER ◽  
Paula BUTTERY

AbstractWe select three word segmentation models with psycholinguistic foundations – transitional probabilities, the diphone-based segmenter, and PUDDLE – which track phoneme co-occurrence and positional frequencies in input strings, and in the case of PUDDLE build lexical and diphone inventories. The models are evaluated on caregiver utterances in 132 CHILDES corpora representing 28 languages and 11.9 m words. PUDDLE shows the best performance overall, albeit with wide cross-linguistic variation. We explore the reasons for this variation, fitting regression models to performance scores with linguistic properties which capture lexico-phonological characteristics of the input: word length, utterance length, diversity in the lexicon, the frequency of one-word utterances, the regularity of phoneme patterns at word boundaries, and the distribution of diphones in each language. These properties together explain four-tenths of the observed variation in segmentation performance, a strong outcome and a solid foundation for studying further variables which make the segmentation task difficult.


Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 65
Author(s):  
Danny Hucke ◽  
Carl Philipp Reh

A grammar-based compressor is an algorithm that receives a word and outputs a context-free grammar that only produces this word. The approximation ratio for a single input word is the size of the grammar produced for this word divided by the size of a smallest grammar for this word. The worst-case approximation ratio of a grammar-based compressor for a given word length is the largest approximation ratio over all input words of that length. In this work, we study the worst-case approximation ratio of the algorithms Greedy, RePair and LongestMatch on unary strings, i.e., strings that only make use of a single symbol. Our main contribution is to show the improved upper bound of O((logn)8·(loglogn)3) for the worst-case approximation ratio of Greedy. In addition, we also show the lower bound of 1.34847194⋯ for the worst-case approximation ratio of Greedy, and that RePair and LongestMatch have a worst-case approximation ratio of log2(3).


10.1558/37291 ◽  
2018 ◽  
Vol 2 (2) ◽  
pp. 242-263
Author(s):  
Stefano Rastelli ◽  
Kook-Hee Gil

This paper offers a new insight into GenSLA classroom research in light of recent developments in the Minimalist Program (MP). Recent research in GenSLA has shown how generative linguistics and acquisition studies can inform the language classroom, mostly focusing on what linguistic aspects of target properties should be integrated as a part of the classroom input. Based on insights from Chomsky’s ‘three factors for language design’ – which bring together the Faculty of Language, input and general principles of economy and efficient computation (the third factor effect) for language development – we put forward a theoretical rationale for how classroom research can offer a unique environment to test the learnability in L2 through the statistical enhancement of the input to which learners are exposed.


Sign in / Sign up

Export Citation Format

Share Document