Joustavaa lauseoppia

Summary: Towards flexible syntax

Huomautuksia teoreettisen syntaksin käytäntöön

Summary: The theoretical basis of syntax

Syntaksia suomenruotsalaisittain

Summary: Syntactic features of Finno-Swedish

A mathematical study of fuzzy logic; an algebraic approach

Fuzzy set theory and Fuzzy logic is studied from a mathematical point of view. The main goal is to investigatecommon mathematical structures in various fuzzy logical inference systems and to establish a general mathematical basis for fuzzy logic when considered as multi-valued logic. The study is composed of six distinct publications. The first paper deals with Mattila'sLPC+Ch Calculus. THis fuzzy inference system is an attempt to introduce linguistic objects to mathematical logic without defining these objects mathematically.LPC+Ch Calculus is analyzed from algebraic point of view and it is demonstratedthat suitable factorization of the set of well formed formulae (in fact, Lindenbaum algebra) leads to a structure called ET-algebra and introduced in the beginning of the paper. On its basis, all the theorems presented by Mattila and many others can be proved in a simple way which is demonstrated in the Lemmas 1 and 2and Propositions 1-3. The conclusion critically discusses some other issues of LPC+Ch Calculus, specially that no formal semantics for it is given.In the second paper the characterization of solvability of the relational equation RoX=T, where R, X, T are fuzzy relations, X the unknown one, and o the minimum-induced composition by Sanchez, is extended to compositions induced by more general products in the general value lattice. Moreover, the procedure also applies to systemsof equations. In the third publication common features in various fuzzy logicalsystems are investigated. It turns out that adjoint couples and residuated lattices are very often present, though not always explicitly expressed. Some minor new results are also proved.The fourth study concerns Novak's paper, in which Novak introduced first-order fuzzy logic and proved, among other things, the semantico-syntactical completeness of this logic. He also demonstrated that the algebra of his logic is a generalized residuated lattice. In proving that the examination of Novak's logic can be reduced to the examination of locally finite MV-algebras.In the fifth paper a multi-valued sentential logic with values of truth in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper developes some ideas of Goguen and generalizes the results of Pavelka on the unit interval. Our proof for the completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if, and only if the algebra of the valuesof truth is a complete MV-algebra. The Compactness Theorem holds in our well-defined fuzzy sentential logic, while the Deduction Theorem and the Finiteness Theorem do not. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. The last paper is a continuation of the fifth study. The semantics and syntax of fuzzy predicate logic with values of truth in ana injective MV-algerba are introduced, and a list of universally valid sentences is established. The system is proved to be semanticallycomplete. This proof is based on an idea utilizing some elementary properties of injective MV-algebras and MV-homomorphisms, and is purely algebraic.

A Dependency Parsing Approach to Biomedical Text Mining

Biomedical research is currently facing a new type of challenge: an excess of information, both in terms of raw data from experiments and in the number of scientific publications describing their results. Mirroring the focus on data mining techniques to address the issues of structured data, there has recently been great interest in the development and application of text mining techniques to make more effective use of the knowledge contained in biomedical scientific publications, accessible only in the form of natural human language. This thesis describes research done in the broader scope of projects aiming to develop methods, tools and techniques for text mining tasks in general and for the biomedical domain in particular. The work described here involves more specifically the goal of extracting information from statements concerning relations of biomedical entities, such as protein-protein interactions. The approach taken is one using full parsing—syntactic analysis of the entire structure of sentences—and machine learning, aiming to develop reliable methods that can further be generalized to apply also to other domains. The five papers at the core of this thesis describe research on a number of distinct but related topics in text mining. In the first of these studies, we assessed the applicability of two popular general English parsers to biomedical text mining and, finding their performance limited, identified several specific challenges to accurate parsing of domain text. In a follow-up study focusing on parsing issues related to specialized domain terminology, we evaluated three lexical adaptation methods. We found that the accurate resolution of unknown words can considerably improve parsing performance and introduced a domain-adapted parser that reduced the error rate of theoriginal by 10% while also roughly halving parsing time. To establish the relative merits of parsers that differ in the applied formalisms and the representation given to their syntactic analyses, we have also developed evaluation methodology, considering different approaches to establishing comparable dependency-based evaluation results. We introduced a methodology for creating highly accurate conversions between different parse representations, demonstrating the feasibility of unification of idiverse syntactic schemes under a shared, application-oriented representation. In addition to allowing formalism-neutral evaluation, we argue that such unification can also increase the value of parsers for domain text mining. As a further step in this direction, we analysed the characteristics of publicly available biomedical corpora annotated for protein-protein interactions and created tools for converting them into a shared form, thus contributing also to the unification of text mining resources. The introduced unified corpora allowed us to perform a task-oriented comparative evaluation of biomedical text mining corpora. This evaluation established clear limits on the comparability of results for text mining methods evaluated on different resources, prompting further efforts toward standardization. To support this and other research, we have also designed and annotated BioInfer, the first domain corpus of its size combining annotation of syntax and biomedical entities with a detailed annotation of their relationships. The corpus represents a major design and development effort of the research group, with manual annotation that identifies over 6000 entities, 2500 relationships and 28,000 syntactic dependencies in 1100 sentences. In addition to combining these key annotations for a single set of sentences, BioInfer was also the first domain resource to introduce a representation of entity relations that is supported by ontologies and able to capture complex, structured relationships. Part I of this thesis presents a summary of this research in the broader context of a text mining system, and Part II contains reprints of the five included publications.

Palveluväylän hyödyntäminen palvelukeskeisessä arkkitehtuurissa

Palvelukeskeinen arkkitehtuuri on uusi tapa rakentaa tietojärjestelmiä. Se perustuu siihen, että logiikasta koostetaan yleiskäyttöisiä palveluita, joita tarjotaan muiden järjestelmän osien käyttöön. Tällöin samoja asioita ei tarvitse toteuttaa moneen kertaan ja järjestelmää voidaan hyödyntää tehokkaasti ja monipuolisesti. Näiden palveluiden hallinnassa voidaan hyödyntää palveluväyliä, eli ESB -tuotteita. Palveluväylät sisältävät erilaisia mekanismeja, joiden avulla palveluihin liittyvää viestiliikennettä voidaan reitittää, muokata ja valvoa eri tavoin. Nykyisissä palvelukeskeisissä toteutuksissa käytetään usein XML -kieleen pohjautuvia Web Service -määrityksiä. Ne tarjoavat ympäristöriippumattoman pohjan, joka täyttää suoraan useita palvelukeskeisen arkkitehtuurin vaatimuksia. Määritysten ympärille on myös paljon valmiita laajennuksia, joiden avulla palveluihin voidaan liittää lisätoiminnallisuutta. Lahden kaupunki lähti Fenix -projektin yhteydessä kehittämään uutta kuntien käyttöön soveltuvaa järjestelmää, joka hyödyntää palvelukeskeisen arkkitehtuurin periaatteita. Järjestelmä jaettiin selkeisiin kerroksiin siten, että käyttöliittymä erotettiin palvelulogiikoista palveluväylän avulla. Tällöin järjestelmä saatiin jaettua loogisiin kokonaisuuksiin, joilla on selkeä rooli. Taustapalvelut hoitavat käsitteiden hallinnan, sekä niihin liittyvät liiketoimintasäännöt. Käyttöliittymäkerros hoitaa tiedon esittämisen ja tarjoaa graafisen, selainpohjaisen käyttöliittymän palveluihin. Palveluväylä hoitaa liikenteen reitittämisen, sekä huolehtii palveluihin liittyvistä käyttöoikeuksista ja tilastoinnista. Lopputuloksena on loputtomiin laajennettavissa oleva järjestelmä, jonka päälle voidaan kehittää erilaisia sähköisiä palveluita kunnan ja sen asukkaiden välille.

Teaching mathematics and programming : new approaches with empirical evaluation

Programming and mathematics are core areas of computer science (CS) and consequently also important parts of CS education. Introductory instruction in these two topics is, however, not without problems. Studies show that CS students find programming difficult to learn and that teaching mathematical topics to CS novices is challenging. One reason for the latter is the disconnection between mathematics and programming found in many CS curricula, which results in students not seeing the relevance of the subject for their studies. In addition, reports indicate that students' mathematical capability and maturity levels are dropping. The challenges faced when teaching mathematics and programming at CS departments can also be traced back to gaps in students' prior education. In Finland the high school curriculum does not include CS as a subject; instead, focus is on learning to use the computer and its applications as tools. Similarly, many of the mathematics courses emphasize application of formulas, while logic, formalisms and proofs, which are important in CS, are avoided. Consequently, high school graduates are not well prepared for studies in CS. Motivated by these challenges, the goal of the present work is to describe new approaches to teaching mathematics and programming aimed at addressing these issues: Structured derivations is a logic-based approach to teaching mathematics, where formalisms and justifications are made explicit. The aim is to help students become better at communicating their reasoning using mathematical language and logical notation at the same time as they become more confident with formalisms. The Python programming language was originally designed with education in mind, and has a simple syntax compared to many other popular languages. The aim of using it in instruction is to address algorithms and their implementation in a way that allows focus to be put on learning algorithmic thinking and programming instead of on learning a complex syntax. Invariant based programming is a diagrammatic approach to developing programs that are correct by construction. The approach is based on elementary propositional and predicate logic, and makes explicit the underlying mathematical foundations of programming. The aim is also to show how mathematics in general, and logic in particular, can be used to create better programs.

OpenAIRE compatibility for DSpace repositories

Workshop at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

Visuell läsning som kompetensområde : en pedagogisk studie i visuell grammatik inom multimodal digital kommunikation

Avhandlingens primära syfte är att upprätta en förståelse för visuell kompetens som en del av visuell litteracitet inom multimodal digital kommunikation i undervisningen. Avhandlingens sekundära syfte är att ur ett pedagogiskt perspektiv lyfta fram visuell litteracitet och visuell kompetens i multimodala diskussioner kring digital pedagogik. Forskningen är kvalitativ och har både teoretisk och empirisk förankring. Den empiriska studien har en fenomenologisk metodansats. Visuell kompetens innebär att visuell läsning behärskas, vilket förutsätter fungerande vokabulär, kritiskt förhållningssätt och kunskaper i läsning och tolkning och användning av bilder. Den visuella grammatikteorin innefattar bildens syntax och semantik. Bilden är ett kontextbundet fenomen, där kontexten berör sociala aspekter, bildens fysiska omgivning samt innehåll. Det empiriska resultatet är att visuell inverkan i undervisningen präglar förberedelser och lektionsmål, berör visuell kommunikationskompetens, inkluderar visuella element som verktyg, strävar involvera flera element i inlärningen och strävar efter att undvika passiva demonstrationer som undervisningsmetod. Bilder behövs som kommunikativt stöd, som inlärningsmetod och som en del i aktivitetspedagogisk undervisning. Genom stöd från läraren kan barnet nå visuell litteracitet som ett kompetensmål, vilket kan ske genom multimodal undervisning.

Defining Contexts in Context-Free Grammars

This thesis introduces an extension of Chomsky’s context-free grammars equipped with operators for referring to left and right contexts of strings.The new model is called grammar with contexts. The semantics of these grammars are given in two equivalent ways — by language equations and by logical deduction, where a grammar is understood as a logic for the recursive definition of syntax. The motivation for grammars with contexts comes from an extensive example that completely defines the syntax and static semantics of a simple typed programming language. Grammars with contexts maintain most important practical properties of context-free grammars, including a variant of the Chomsky normal form. For grammars with one-sided contexts (that is, either left or right), there is a cubic-time tabular parsing algorithm, applicable to an arbitrary grammar. The time complexity of this algorithm can be improved to quadratic,provided that the grammar is unambiguous, that is, it only allows one parsefor every string it defines. A tabular parsing algorithm for grammars withtwo-sided contexts has fourth power time complexity. For these grammarsthere is a recognition algorithm that uses a linear amount of space. For certain subclasses of grammars with contexts there are low-degree polynomial parsing algorithms. One of them is an extension of the classical recursive descent for context-free grammars; the version for grammars with contexts still works in linear time like its prototype. Another algorithm, with time complexity varying from linear to cubic depending on the particular grammar, adapts deterministic LR parsing to the new model. If all context operators in a grammar define regular languages, then such a grammar can be transformed to an equivalent grammar without context operators at all. This allows one to represent the syntax of languages in a more succinct way by utilizing context specifications. Linear grammars with contexts turned out to be non-trivial already over a one-letter alphabet. This fact leads to some undecidability results for this family of grammars

Suomen essiivi

Essiivi on suomen kielen sijamuoto, jota käytetään nykykielessä erilaisten olotilojen ilmaisemiseen (Hän on opettajana ~ sairaana). Se on taustaltaan lokatiivi, jonka paikanilmaisutehtävä näkyy edelleen erilaisissa kiteytymissä (kotona, luona). Essiivi kuuluu myös ajankohdanilmaisujärjestelmään (lauantaina, ensi vuotena). Tässä tutkimuksessa kuvaan essiivisijan käyttöä erityisesti olotilan ilmaisemisen näkökulmasta. Kiinnitän huomiota sijan merkitykseen ja pyrin tarkentamaan sen lauseopillista kuvausta hyödyntämällä yleislingvistis-kielitypologisia olotilanilmausten kategoriointitapoja. Tutkimukseni aineisto on kolmijakoinen. Pääaineistonani on Lauseopin arkisto, jota koskevan haun tuloksena olen saanut 9096 essiivisijaisen sanan sisältävää lauseketta virkekonteksteineen. Täydennän tätä aineistoa käytöstä poimituilla esimerkeillä ja intuitioon pohjautuvilla ns. selvillä tapauksilla. Tutkimusmenetelmänä on pääosin aineiston kvalitatiivinen tarkastelu, mutta tarkastelen essiiviä myös teoreettisemmin sääntöjärjestelmän näkökulmasta. Tärkeimpänä lähtökohtanani on tuottaa tutkimustietoa, joka kykenee käymään vuoropuhelua kielitypologisen tutkimuksen kanssa siten, että tutkimus kuitenkin tapahtuu yksittäiskielen ehdoilla. Erityisesti semantiikan kuvauksessa tarkastelutapani on kognitiivisen kielitieteen mukaisesti orientoitunut. Essiivin tehtävänä on pelkistetyssä nominaalilauseessa ilmaista olotilan tilapäisyyttä ja muutoksellisuutta, kun taas merkitystä kantavan verbin yhteydessä essiivisijainen olotilan ilmaus saa usein muita merkityksiä ja voi ilmaista myös vaihtoehtoisen tai tilanteen syynä olevan olotilan. Aspektinäkökulmasta essiivi tuo tilaan toimin¬nallisia piirteitä, ja se myös muodostaa selvästi omanlaisensa reviirin suhteessa muihin olotilaa ja sen lähimerkityksiä ilmaiseviin kieli- ja johto-opin kategorioihin. Syntaktisen luokittelun näkökulmasta essiivisijaiset predikoivat olotilanilmaukset jakautuvat kolmeen pääryhmään sen perusteella, millainen niiden suhde lauseen predikaattiin on. Ne voivat toimia kopulalauseen nominaalipredikaatteina, merkitystä kantavien verbien täydennyksinä ja sekundaarisina predikaatteina, jotka ovat määritteitä. Lisäksi essiivisijaiset olotilan ilmaukset voivat toimia predikoimattomina lauseadverbiaaleina. Tutkimus on essiivisijan laaja aineistopohjainen kuvaus, joka osoittaa, että yleislingvistis-kielitypologinen lähestymistapa sopii suomen essiivin kuvaukseen. Alakategorioinnissa joudutaan kuitenkin turvautumaan semantiikkaan. Myös pääkategorioiden jatkumomaisuus on hyväksyttävä. Tulosten perusteella on mahdollista käydä keskustelua siitä, olisiko predikoivien lauseenjäsenten syntaktista luokittelua mahdollista uudistaa. Lisäksi tutkimus avaa uusia kysymyksiä tutkittavaksi erityisesti sijojen käyttöä vertailevasta näkökulmasta.