Search results for "Computational Linguistic"

Linguistic interpretation of speech errors

2016

The paper is an attempt to illustrate the linguistic interpretation of speech, known that it remains insufficiently resolved, especially for Romanian. The cause is given by the multitude of criteria that can or should be considered important in speech processing. The aim of this study is to develope a computational tool in order to identify the possible errors related to the morphosintactic structure of speech. Our goal is to assist users who can receive automatically different suggestions that can help them to improve the quality of their text. Thus, we chose an interdisciplinary approach through speech analysis that brings together the key fields of linguistics, computer science and so on…

Latviešu valodas izrunas datormodelēšana

2005

Unambiguous recognizable two-dimensional languages

2006

We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.

Are tools all we need? Digital Humanities in the time of its institutionalisation

2011

Three key features of the Digital Humanities today are its quantitative growth, its institutionalisation and its definition as a discipline. In the first part of this article (2. Institutional models) I shall pinpoint some models of institutionalisation that are emerging in the international scenario. Against this background, I shall then discuss (3. Tools) some concepts central to Digital Humanities’ self-definition, such as those of practice, ‘building’, centre, project, product and tools, particularly questioning the opinion that the creation of friendly digital tools is the key issue in the future of the field. I shall finally suggest that ‘instrumentalism’, ‘project fever’ and an exces…

On the Shuffle of Star-Free Languages

2012

Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.

Verbal sets and cyclic coverings

2010

Abstract We consider groups G such that the set of all values of a fixed word w in G is covered by a finite set of cyclic subgroups. Fernandez-Alcober and Shumyatsky studied such groups in the case when w is the word [ x 1 , x 2 ] , and proved that in this case the corresponding verbal subgroup G ′ is either cyclic or finite. Answering a question asked by them, we show that this is far from being the general rule. However, we prove a weaker form of their result in the case when w is either a lower commutator word or a non-commutator word, showing that in the given hypothesis the verbal subgroup w ( G ) must be finite-by-cyclic. Even this weaker conclusion is not universally valid: it fails …

Combinatorics of Finite Words and Suffix Automata

2009

The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.

Universal Lyndon Words

2014

A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…

Minimal forbidden words and symbolic dynamics

1996

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

ON THE STAR HEIGHT OF RATIONAL LANGUAGES

1994

Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…