We propose a new order-theoretic characterisation of the class of polytime computable functions. To this avail we define the small polynomial path order ([Formula: see text] for short). This termination order entails a new syntactic method to analyse the innermost runtime complexity of term rewrite systems fully automatically: for any rewrite system compatible with [Formula: see text] that empl...

We compared entropy for texts written in natural languages (English, Spanish) and artificial languages (computer software) based on a simple expression for the entropy as a function of message length and specific word diversity. Code text written in artificial languages showed higher entropy than text of similar length expressed in natural languages. Spanish texts exhibit more symbolic diversit...

In this paper we describe a very simple and efficient method for the détection and recognition of the Malayalam text from colour natural scene images taken by a mobile phone camera. Malayalam text detection, skew correction of the detected text ,text segmentation and character recognition are the important steps in text understanding from natural scene images. Text understanding in natural scen...

Nanomedicine is an emerging discipline aimed to applying recent developments in nanotechnology to the medical domain. In recent years, there has been an exponential growth of the number of available nanomedical resources. The latter are aimed to different tasks and include databases, nanosensors, implantable materials, etc. This leads to the necessity of creating new methods to automatically or...

We report three user studies in which the Lexical Simplification needs of non-native English speakers are investigated. Our analyses feature valuable new insight on the relationship between the non-natives’ notion of complexity and various morphological, semantic and lexical word properties. Some of our findings contradict long-standing misconceptions about word simplicity. The data produced in...

The entities mentioned in collections of scholarly articles in the Humanities (and in other scholarly domains) belong to different types from those familiar from news corpora, hence new resources need to be annotated to create supervised taggers for tasks such as ne extraction. However, in such domains there is a great need for making the best use possible of the annotators. One technique desig...

Based on the principle of cognitive economy, the complexity and the information of textual context are proposed to measure subjective cognitive degree of textual context. Based on minimization of Boolean complexity in human concept learning, the complexity and the difficulty of textual context are defined in order to mimic human’s reading experience. Based on maximal relevance principle, the in...

We consider the approximate pattern matching problem. Given a text T of length 2n and a pattern P of length n, the task is to decide for each prefix T [1, j] of T if it ends with a string that is at the edit distance at most k from P . If this is the case, we must output the edit distance and the corresponding edit operations. We first look at the communication complexity of the problem. We sho...

We introduce Kolmogorov Complexity measures as a way of extracting structural information from texts for Intrinsic Plagiarism Detection. Kolmogorov complexity measures have been used as features in a variety of machine learning tasks including image recognition, radar signal classification, EEG classification, DNA analysis, speech recognition and some text classification tasks (Chi and Kong, 19...

In order to train a classifier that generalizes well, different learning problems, in particular high-dimensional ones such as text classification, can require widely different amounts of training, as measured in terms of the number of training instances required to reach adequate accuracy or the number of features effectively utilized in the classifier. We define several measures of learning d...