BILC 2011 Abstracts
Full Papers
| Paper Nr: | 1 |
| Title: | Finite-state Acceptors with Translucent Letters |
| Authors: | Benedek Nagy and Friedrich Otto |
| Abstract: | Finite-state acceptors with translucent letters are presented. These devices do not read their input strictly from left to right as in the traditional setting, but for each internal state of such a device, certain letters are translucent, that is, in this state the acceptor cannot see them. We describe the computational power of these acceptors, both in the deterministic and in the nondeterministic case. The languages accepted have semi-linear Parikh images, and the nondeterministic acceptors are sufficiently expressive to accept all rational trace languages. However, in contrast to the classical finite-state acceptors, the deterministic acceptors are less expressive than the nondeterministic ones. |
| Paper Nr: | 4 |
| Title: | Vowel-consonant Speech Segmentation by Neuromorphic Units |
| Authors: | Pedro Gómez-Vilda and Roberto Fernández-Baíllo |
| Abstract: | For the time being speech is still a much complex process far from being fully understood. To gain some insight on specific open problems in its automatic treatment (recognition, synthesis, diarization, segmentation, etc.) neuromorphisms and knowledge derived from the understanding on how the Auditory System proceeds may be of crucial importance. The present paper must be seen as in a series of preliminary work carried out trying to translate some of this understanding to solve specific tasks as speech segmentation and labelling in a parallel way to the neural resources found in the Auditory Pathways and Cortex. The bio-inspired (neuromorphic) design of some elementary units covering simple tasks as formant tracking or formant dynamics is exposed. In a further step it is shown how simply neural circuits employing these units may convey successful vowel-consonant separation independently of the speaker. The paper is completed with the discussion on how this processing may be used to develop specific applications as in Speech Segmentation and Diarization and in Speaker Characterization. |
| Paper Nr: | 6 |
| Title: | Modeling of Cognitive Agents |
| Authors: | Dariusz Plewczynski |
| Abstract: | Agent-based Modeling (ABM), a novel computational modeling paradigm, is the modeling of phenomena as dynamical systems of interacting agents. Here, we apply this methodology for designing cognitive agents that are allowed to perform categorization process of input training items. The internal agent structure, as in presented previously brainstorming algorithm, and it is equipped with the set of basic machine learning, or clustering algorithms, which allow it for constructing prototypes of categories. Agent links prototypical categories with the subsets of training objects (so called prototypes for a category) during the simulation time. The equilibration process is described here using the mean-field theory, and fully connected cellular automata network of different categories. The individual outcomes of clustering, or machine learning algorithms are combined in order to determine the most effective partitioning of a given training data into the set of distinct categories. The dynamics of cellular automata network simulates the higher level of information integration acquired from repetitive learning trials. The final categorization of training objects is therefore consistent with equilibrium state of the complex system of linked and interacting machine learning methods, each representing different category. The proposed cognitive agent is the first autonomous cognitive system that is able to build the classification system for given perceptual information using ensemble of machine learning algorithms. |
| Paper Nr: | 7 |
| Title: | NEPs-Lingua: A New Textual Language to Program NEPs |
| Authors: | M. de la Cruz, A. Jiménez and E. del Rosal |
| Abstract: | Networks of Evolutionary Processors (NEPs) are one of the currently most used new types of natural computers. This paper briefly describes the model and some developing tools for NEPs. Then, it describes NEPs-Lingua, a new textual programming language for NEPs. Its two main goals are: reducing the size needed by other representations and keeping the syntax as close as possible to the one used to define NEPs in the literature. Some examples and future research lines are also discussed. |
| Paper Nr: | 8 |
| Title: | On Representing Natural Languages and Bio-molecular Structures using Matrix Insertion-deletion Systems and its Computational Completeness |
| Authors: | Lakshmanan Kuppusamy |
| Abstract: | Insertion and deletion are considered to be the basic operations in Biology, more specifically in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model insertion-deletion system has been proposed in formal language theory. Recently, in [14], a new computing model named Matrix insertion-deletion system has been introduced to model various bio-molecular structures. In this paper, we represent some natural language constraints such as triple agreement, crossed dependency, copy language using Matrix insertion-deletion systems and discuss how these constraints resemble some bio-molecular structures. Next, we analyze the computational completeness result for Matrix insertion-deletion system where the importance is given for not using any contexts when deletion rule takes place.We see that when the insertion-deletion system is combined with matrix grammar, the universality result is obtained with weight just 3 (1, 1; 1, 0) whereas for insertion-deletion systems, the universality result is available with weight 4 (1, 1; 1, 1). |
| Paper Nr: | 10 |
| Title: | A Grammatical View of Language Evolution |
| Authors: | Gemma Bel-Enguix |
| Abstract: | Language evolves gradually through its use: over time, new forms come into fashion and others become obsolete. While traditionally a grammar provides a snapshot of an individual’s or a society’s linguistic competence at a given point in time, our aim is to extend grammars to incorporate competences related to evolution. This paper shows how language evolution can be modeled using Adaptable Grammars, which may be defined as logically based transformational grammars in which the grammar itself may be affected in a derivation step. |
| Paper Nr: | 11 |
| Title: | Children as Models for Computers: Natural Language Acquisition for Machine Learning |
| Authors: | Leonor Becerra-Bonache and M. Dolores Jiménez-López |
| Abstract: | This paper focuses on a subfield of machine learning, the so-called grammatical inference. Roughly speaking, grammatical inference deals with the problem of inferring a grammar that generates a given set of sample sentences in some manner that is supposed to be realized by some inference algorithm. We discuss how the analysis and formalization of the main features of the process of human natural language acquisition may improve results in the area of grammatical inference. |
| Paper Nr: | 12 |
| Title: | Parsing Medical Text into De-identified Databases |
| Authors: | Veronica Dahl |
| Abstract: | De-identification is the process of automatic removal of all Private Health Information (PHI) from medical records. The main focus in this active and important research area is on semi-structured records. This narrow focus has allowed the development of standard criteria that formally determines the boundaries of privacy and can be used for evaluations. However, medical records include, as well as semi-structured data from filling in forms, etc., free text in which identifiers are more difficult to detect. In this article we address the problem of de-identification within unstructured medical records.We show how through the followingmethods we are able to recognize, in some cases, identifiers that currently go undetected: (1) Parsing free-form medical text into typed logical relationships including assumptions for candidate identifiers. (2) A novel use of the state-of-the-art engines for processing English queries to the web. A formal definition of our approach within a rigorous logical system that supports the implementation of our ideas, is also available on the website. |
| Paper Nr: | 13 |
| Title: | Minimal Recursion Semantics and the Language of Acyclic Recursion |
| Authors: | Roussanka Loukanova |
| Abstract: | Moschovakis (2003-2006) developed a logical calculus of the formal language Lλar of acyclic recursion, which is a type-theoretical work with many potential applications. On the implementation side, large-scale grammars for human languages, e.g. versions of HPSG, have been using semantic representations casted in the feature-value language Minimal Recursion Semantics (MRS).While lacking strict formalization, MRS represents successfully ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the language Lλar . |