992 resultados para natural languages


Relevância:

60.00% 60.00%

Publicador:

Resumo:

The paper aims to represent a bilingual online dictionary as a useful tool helping preservation of the natural languages. The author focuses on the approach that was taken to develop compatible bilingual lexical database for the Bulgarian-Polish online dictionary. A formal model for the dictionary encoding is developed in accordance with the complex structures of the dictionary entries. These structures vary depending on the grammatical characteristics of Bulgarian headwords. The Web-application for presentation of the bilingual dictionary is also describred.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

After defining the “enunciative scheme” (sentence type) as a communicative unit, the imperative is characterized as a morphologized modality of appellative kind used when the following conditions occur: appellative meaning, 2nd person, future tense and absence of negation. In Spanish, any variation of any of these requirements determines that the subjunctive is used. We reject the idea that the imperative is a variant of subjunctive specialized in appellative function and that both modes share a desiderative morpheme. Working in this way means attributing to a morphological category of the verb a property that actually corresponds to the enunciative schemes (sentence types). We propose to integrate the imperative and subjunctive in the framework of what we call the “desiderative-appellative space”. This “space” brings together various grammatical or grammaticalized means based on the imperative and the subjunctive. Semantically, it is organized around a component of desirability (action appears as desirable) that, by varying several factors, configures a route that goes from a center (the imperative) to a periphery (the expression of desire).

Relevância:

60.00% 60.00%

Publicador:

Resumo:

This work focuses in the formal and technical analysis of some aspects of a constructed language. As a first part of the work, a possible coding for the language will be studied, emphasizing the pre x coding, for which an extension of the Hu man algorithm from binary to n-ary will be implemented. Because of that in the language we can't know a priori the frequency of use of the words, a study will be done and several strategies will be proposed for an open words system, analyzing previously the existing number of words in current natural languages. As a possible upgrade of the coding, we'll take also a look to the synchronization loss problem, as well as to its solution: the self-synchronization, a t-codes study with the number of possible words for the language, as well as other alternatives. Finally, and from a less formal approach, several applications for the language have been developed: A voice synthesizer, a speech recognition system and a system font for the use of the language in text processors. For each of these applications, the process used for its construction, as well as the problems encountered and still to solve in each will be detailed.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Researches in Requirements Engineering have been growing in the latest few years. Researchers are concerned with a set of open issues such as: communication between several user profiles involved in software engineering; scope definition; volatility and traceability issues. To cope with these issues a set of works are concentrated in (i) defining processes to collect client s specifications in order to solve scope issues; (ii) defining models to represent requirements to address communication and traceability issues; and (iii) working on mechanisms and processes to be applied to requirements modeling in order to facilitate requirements evolution and maintenance, addressing volatility and traceability issues. We propose an iterative Model-Driven process to solve these issues, based on a double layered CIM to communicate requirements related knowledge to a wider amount of stakeholders. We also present a tool to help requirements engineer through the RE process. Finally we present a case study to illustrate the process and tool s benefits and usage

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Caption title: nos. 1-4, Atlantic journal, and firend of knowledge; a cyclopedic journal and review of universal science and knowledge: historical, natural, and medical arts and sciences. -- nos. 5-8, Atlantic journal and friend of knowledge; a quarterly journal of historical and natural sciences, useful knowledge, &c.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A one-sided classifier for a given class of languages converges to 1 on every language from the class and outputs 0 infinitely often on languages outside the class. A two-sided classifier, on the other hand, converges to 1 on languages from the class and converges to 0 on languages outside the class. The present paper investigates one-sided and two-sided classification for classes of recursive languages. Theorems are presented that help assess the classifiability of natural classes. The relationships of classification to inductive learning theory and to structural complexity theory in terms of Turing degrees are studied. Furthermore, the special case of classification from only positive data is also investigated.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Facilitated discussion with early childhood staff working with children and families affected by natural disasters in Queensland, Australia, raises issues regarding educational communication in emergencies. This paper reports on these discussions as ‘reflections on talk’. It examines discrepancies between the literature and staff talk, gaps in the literature, and the inaccessible style of some literature-demanded collaborative debate and information re-interpretation. Reframing of the discourse style was used to support staff de-briefing, mutual encouragement, and sharing of insights on promoting resilience in children and families. Formal investigation is required regarding effective emergency-situation talk between staff, as well as with children and families.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).