Search results for " Natural Language"
showing 10 items of 192 documents
Fuzzy Logic, Knowledge and Natural Language
2012
This is an introductive study on what Fuzzy Logic is, on the difference between Fuzzy Logic and the other many-valued calculi and on the possible relationship between Fuzzy Logic and the complex sciences. Fuzzy Logic is nowadays a very popular logic methodology. Different kinds of applications in cybernetics, in software programming and its growing use in medicine seems to make Fuzzy Logic, according to someone, the “new” logic of science and technology. In his enthusiastic panegyric of Fuzzy Logic, Kosko (1993) argues that after thirty years from the birth of this calculus, it is time to declare the new era of Fuzzy Logic and to forget the old era of classical logic. I think that this poin…
Vertical Representation of C∞-words
2015
International audience; We present a new framework for dealing with C∞-words, based on their left and right frontiers. Thisallows us to give a compact representation of them, and to describe the set of C∞-words throughan infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers ofC∞-words. We show that this map can be defined recursively and with no explicit reference toC∞-words. We then show that some important conjectures on C∞-words follow from analogousstatements on the structure of the graph G.
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Embedded controlled language to facilitate information extraction from eGov policies
2015
The goal of this paper is to propose a system that can extract formal semantic knowledge representation from natural language eGov policies. We present an architecture that allows for extracting Controlled Natural Language (CNL) statements from heterogeneous natural language texts with the ability to support multilinguality. The approach is based on the concept of embedded CNLs.
The hidden side of adverbs
2018
This paper will address the predicative nature of manner adverb(ial)s and of three types of sentence adverbs (subject-oriented, modal, and evaluative) in Italian. Predication often becomes overt by means of morphological correlates. Is it possible to find any such evidence with invariable adverbs? To unveil their predicative nature, a procedure will be suggested in which two sentences, one with a -mente adverb, the other with its cognate adjective (a) share the content morphemes (identity of the signifiant) and (b) entail each other (identity of the signifié as regards semantic roles). A number of such pairs will be discussed, examples of which include: Intelligentemente, Leo intervenne ‘Cl…
Genus im DaF-Unterricht in Italien: Was sagen Lehrwerke und Grammatiken?
2011
For foreign language students gender seems to be a great problem. This article about the teachability and learnability of German gender wants to show what Italian students learn about it and how they do so (and also how they could do it better).
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
Mapping wordnets from the perspective of inter-lingual equivalence
2017
Mapping wordnets from the perspective of inter-lingual equivalence This paper explores inter-lingual equivalence from the perspective of linking two large lexico-semantic databases, namely the Princeton WordNet of English and the plWordnet ( pl. Slowosiec ) of Polish. Wordnets are built as networks of lexico-semantic relations between words and their meanings, and constitute a type of monolingual dictionary cum thesaurus. The development of wordnets for different languages has given rise to many wordnet linking projects (e.g. EuroWordNet, Vossen, 2002). Regardless of a linking method used, these projects require defining rules for establishing equivalence links between wordnet building bloc…
Abstract Syntax as Interlingua: Scaling Up the Grammatical Framework from Controlled Languages to Robust Pipelines
2020
Abstract syntax is an interlingual representation used in compilers. Grammatical Framework (GF) applies the abstract syntax idea to natural languages. The development of GF started in 1998, first as a tool for controlled language implementations, where it has gained an established position in both academic and commercial projects. GF provides grammar resources for over 40 languages, enabling accurate generation and translation, as well as grammar engineering tools and components for mobile and Web applications. On the research side, the focus in the last ten years has been on scaling up GF to wide-coverage language processing. The concept of abstract syntax offers a unified view on many oth…
Particle Swarm Optimization as a New Measure of Machine Translation Efficiency
2018
The present work proposes a new approach to measuring efficiency of evolutionary algorithm-based Machine Translation. We implement some attributes of evolutionary algorithms performing cosine similarity objective function of a Particle Swarm Optimization (PSO) algorithm then, we evaluate an English text set for translation precision into the Spanish text as a simulated benchmark, and explore the backward process. Our results show that PSO algorithm can be used for translation of multiple language sentences with one identifier only, in other words the technology presented is language-pair independent. Specifically, we indicate that our cosine similarity objective function improves the veloci…