Nucleic acid sequences may be looked upon as words over the alphabet of nucleotides. Naturally occurring DNAs and RNAs form subsets of the set of all possible words. The use of formal languages is proposed to describe the structure of these subsets. Regular languages defined by finite automata are introduced to demonstrate the application of the concept on RNA-phages of group I. This approach p...

Assessment of the similarities between texts has been studied for decades from different perspectives and for several purposes. One interesting perspective is the morphology. This article reports the results on a study on the assessment of the morphological relatedness between natural language words. The main idea is to adapt a formal string alignment algorithm namely Needleman-Wunsch’s to acco...

This paper describes an algorithm for the construction of a certain one-dimensional cellular automaton equivalent to a given D0L system. A cellular automaton is considered equivalent to an L-system if both generates the same words in the same order. Our cellular automata produce the same words and in the same order as the given D0L system for a finite number of derivations. There is no constrai...

In this paper, we describe RitsQA: Ritsumeikan question answering system. In our QA system, input query sentence is firstly analyzed using question patterns consist of description of NE elements, POS of words and surface expressions. Then, query type and some clue words, which are used for document retrieval, are determined. For answer extraction, our system uses word distance between answer ca...

Learning to read and write generates new rules within the language processing systems. These new rules significantly change the manner in which some operations are performed. This finding was studied, by comparing the performance of literate and illiterate persons in several tasks. It was found that illiterate individuals (1) had difficulties in repeating pseudowords, (2) were worse at memorizi...

A filtration of a formal language L by a sequence s maps L to the set of words formed by taking the letters of words of L indexed only by s. We consider the languages resulting from filtering by all arithmetic progressions. If L is regular, then we prove that only finitely many distinct languages result. By contrast, there exist CFL’s that give infinitely many distinct languages as a result. We...

We describe two systems that participated in SemEval-2010 task 17 (All-words Word Sense Disambiguation on a Specific Domain) and were ranked in the third and fourth positions in the formal evaluation. Domain adaptation techniques using the background documents released in the task were used to assign ranking scores to the words and their senses. The test data was disambiguated using the Persona...

literature is the aesthetic manifestation of language. it is ‘as old as human language and as new as tomorrow’s sunrise.’ this paper explores the interrelationships between language and literature from 600 ad to the present day.  the grammar of present-day english is closely related to that of old english with the same tense formation and word orders. the verse unit is a single line and its org...