Search results for "Formal Language"

Does "whole-word shape" play a role in visual word recognition?

2002

To analyze the impact of outline shape on visual word recognition, the visual pattern of the stimuli can be distorted by size alternation. Contrary to the predictions of models that rely on outline shape (Allen, Wallace, & Weber, 1995), the effect of size alternationwas greater for low-frequency words than for high-frequency words in a lexical decision task (Experiment 1). In Experiment 2, the effect of case type (lowercase vs. UPPERCASE) occurred for low-frequency words, but not for high-frequency words. The effect of neighborhood size was remarkably similar in the two experiments. The results can be readily explained in the framework of a resonance model (Grossberg & Stone, 1986), in whic…

Cone/wedge resection of renal cell carcinoma

2004

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

Some Contributions to the Algebraic Theory of Automata

2015

En el present treball estudiarem els autòmats des d'una perspectiva tant algebraica com coalgebraica. Volem aprofitar la natura dual d'aquests objectes per a presentar un marc unificador que explique i estenga alguns resultats recents de la teoria d'autòmats. Per tant, la secció 2 conté nocions i definicions preliminars per a mantenir el treball tan contingut com siga possible. Així, presentarem les nocions d'àlgebra i coàlgebra per a un endofunctor. També introduirem alguns conceptes sobre monoides i llenguatges. En aquest capítol també exposarem les nocions d'autòmats deterministes i no deterministes, homomorfismes i bisimulacions d'autòmats i productes i coproductes d'aquestes estructure…

On Prefix Normal Words

2011

We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…

Towards Equivalence Links between Senses in PlWordNet and Princeton WordNet

2017

AbstractThe paper focuses on the issue of creating equivalence links in the domain of bilingual computational lexicography. The existing interlingual links between plWordNet and Princeton WordNet synsets (sets of synonymous lexical units – lemma and sense pairs) are re-analysed from the perspective of equivalence types as defined in traditional lexicography and translation. Special attention is paid to cognitive and translational equivalents. A proposal of mapping lexical units is presented. Three types of links are defined: super-strong equivalence, strong equivalence and weak implied equivalence. The strong equivalences have a common set of formal, semantic and usage features, with some o…

Turing's error-revised

2016

Many important lines of argumentation have been presented during the last decades claiming that machines cannot think like people. Yet, it has been possible to construct devices and information systems, which replace people in tasks which have previously been occupied by people as the tasks require intelligence. The long and versatile discourse over, what machine intelligence is, suggests that there is something unclear in the foundations of the discourse itself. Therefore, we critically studied the foundations of used theory languages. By looking critically some of the main arguments of machine thinking, one can find unifying factors. Most of them are based on the fact that computers canno…