As a reference variety, Received Pronunciation (RP), a non-regional accent of British English, is extensively described both in terms of synchronic variation and its historical development. There is a long tradition of describing changes over time in the traditional phonemic framework. However, modern corpus-based acoustic investigations have not been attempted on material older than the 1950s ...

This article describes a web-based communicative space (a Dynamic Frequently Asked Questions environment—DFAQ) in which learners consult one another using questions, and in which both the flow of interaction and its artefacts become a resource available to a community of learners. Anecdotal evidence suggests that learners embarking on their first year of university study enter a world that is e...

We apply and discuss generalizable Gaussian mixture (GGM) models for textmining. The model automatically adapts model complexity for a given text representation. We show that the generalizability of these models depends on the dimensionality of the representation and the sample size. We discuss the relation between supervised and unsupervised learning in text data. Finally, we implement a novel...

Feature selection is the main step in classification systems, a procedure that selects a subset from original features. Feature selection is one of major challenges in text categorization. The high dimensionality of feature space increases the complexity of text categorization process, because it plays a key role in this process. This paper presents a novel feature selection method based on par...

Most intelligibility tests are based on the use of monosyllabic test stimuli. This constraint eliminates the ability to measure the effects of lexical stress patterns, complex phonotactic organizations, and morphological complexity on intelligibility. Since these aspects of lexical structure affect speech production (e.g., by changing syllable duration), it is likely that they affect the struct...

Retrieving relevant text documents on a topic from a large document collection is a challenging task. Different clustering algorithms are developed to retrieve relevant documents of interest. Hierarchical clustering shows quadratic time complexity of O(n 2 ) for n text documents. K-means algorithm has a time complexity of O(n) but it is sensitive to the initial randomly selected cluster centers...

Support vector machines (SVMs) have been recognized as one of the most successful classification methods for many applications including text classification. Even though the learning ability and computational complexity of training in support vector machines may be independent of the dimension of the feature space, reducing computational complexity is an essential issue to efficiently handle a ...

In this paper, we present a novel hybrid image coding scheme for real-time applications of computer screen video transmission. Based on the Mixed Raster Content (MRC) multilayer imaging model, the background picture is compressed with lossy JPEG, and the foreground layer consisting of text and graphics is compressed with a block-based lossless coding algorithm, which integrates shape-based codi...

The complexity of sentences characteristic to biomedical articles poses a challenge to natural language parsers, which are typically trained on large-scale corpora of non-technical text. We propose a text simplification process, bioSimplify, that seeks to reduce the complexity of sentences in biomedical abstracts in order to improve the performance of syntactic parsers on the processed sentence...