6,913 research outputs found
Electronic Dictionaries for Information Retrieval, Automatic Textual Analysis and Semantic-Based Data Mining Software
No full textToday Lexicon-Grammar (LG) remains one of the most consistent
Natural Language Processing (NLP) approaches, especially for
Semantic-Based Data Mining (SBDM) and Semantic Web. Its main goal
is to describe all mechanisms of word combinations closely related to the
concrete use of lexical units and to sentence creation. Also, it gives an
exhaustive description of lexical and syntactic structures of several
languages. LG was set up by the French linguist Maurice Gross during
the ‘60s, and subsequently developed for and applied to Italian by
Annibale Elia, Emilio D’Agostino and Maurizio Martinelli. Its
theoretical approach is prevalently based on Zelig Sabbettai Harris’
Operator-Argument Grammar, which assumes that each human language
is a self-organizing system, and that the syntactic and semantic properties
of a given word may be calculated on the basis of the relationships this
word has with all other co-occurring words inside given sentence
contexts. Simple sentences2 are the minimal linguistic meaning structures
upon which LG founds its studies on natural language syntactic features.
In the last twenty years, LG has also reached important results in the
domain of automatic textual analysis and parsing with NLP-oriented
software such as INTEX3, UNITEX4, and more recently NOOJ5.
1 Alberto Postiglione is author of paragraph 4.1. Mario Monteleone is author of
paragraphs 3.1 and 4. Federica Marano is author of paragraphs 3.2 and 4.3. Johanna
Monti is author of sections 1 and 2. Antonella Napoli is author of paragraph 4.2.
2 In LG, a simple sentence is formed by a unique predicative element (a verb, but
also a name or an adjective) plus all the necessary arguments it selects to achieve
acceptability and grammaticality. The study of simple sentences is completed analyzing
the rules of co-occurrence and selection restriction, which are distributional and
transformational rules based on predicate syntactic-semantic properties.
3 For more on INTEX, see http://intex.univ-fcomte.fr/.
4 For more on UNITEX, see http://www-igm.univ-mlv.fr/~unitex/.
5 For more on NooJ, see http://www.nooj4nlp.net/pages/nooj.html.
ALBERTO POSTIGLIONE - MARIO MONTELEONE -
FEDERICA MARANO - JOHANNA MONTI - ANTONELLA NAPOLI1
Università degli Studi di Salerno
ELECTRONIC DICTIONARIES FOR INFORMATION RETRIEVAL,
AUTOMATIC TEXTUAL ANALYSIS AND SEMANTIC-BASED
DATA MINING SOFTWARE
1. Theoretical and analytical framework: Lexicon-Gramma
Finite State Automata on Multi-Word Units for Efficient Text-Mining
No full textText mining is crucial for analyzing unstructured and semi-structured textual documents. This paper introduces a fast and precise text mining method based on a finite automaton to extract knowledge domains. Unlike simple words, multi-word units (such as credit card) are emphasized for their efficiency in identifying specific semantic areas due to their predominantly monosemic nature, their limited number and their distinctiveness. The method focuses on identifying multi-word units within terminological ontologies, where each multi-word unit is associated with a sub-domain of ontology knowledge. The algorithm, designed to handle the challenges posed by very long multi-word units composed of a variable number of simple words, integrates user-selected ontologies into a single finite automaton during a fast pre-processing step. At runtime, the automaton reads input text character by character, efficiently locating multi-word units even if they overlap. This approach is efficient for both short and long documents, requiring no prior training. Ontologies can be updated without additional computational costs. An early system prototype, tested on 100 short and medium-length documents, recognized the knowledge domains for the vast majority of texts (over 90%) analyzed. The authors suggest that this method could be a valuable semantic-based knowledge domain extraction technique in unstructured documents
“Textclass - Rel. 1.0"
No full textSistema informatico per analisi contenutistiche e catalogazione di testi scritt
Evaluation of strategies for the iterated prisoner's dilemma
No full textThe study aims to assess the effectiveness and adaptability of both classical and contemporary strategies.
It further explores the implications of strategic diversity and complexity on cooperation and stability within IPD tournaments.
Methods: Strategy tournaments were conducted with an extensive pool of participants, including main Axelrod? original strategies (Tit for Tat, Always Defect, etc.) and modern strategies.
Simulations were performed using custom-built software tested.
The study examined tournaments where strategies remain fixed throughout, by varying the set of participants and using different payoff matrices.
Matches were played with both fixed and variable durations, and in this case the average enrichment for each strategy was considered.
Results: The analysis revealed that Tit for Tat is not the sole dominant strategy. Different levels of strategic complexity and cooperation/defection often led to different winners, especially in environments with a strong Cooperation or Defection connotation. The impact of payoff structures was significant, with even small adjustments shifting the balance between cooperation and defection.
Conclusion: The findings offer an updated perspective on the IPD, highlighting the evolving interplay between strategic design and environmental factors. The results have broader implications for policy-making, algorithm design, and the study of cooperative dynamics across economic, biological, and artificial systems.
Future Directions: Future research could explore strategies developed through machine learning techniques and hybrid approaches combining memory and stochastic elements.
Additional studies could simulate diverse environments by systematically varying payoff matrices and incorporating performance metrics such as robustness and adaptability.
Furthermore, investigating strategies capable of modifying their behavior dynamically within matches would provide deeper insights into adaptive cooperation
Text Mining with Finite State Automata via Compound Words Ontologies
No full textThe paper introduces an efficient text mining method using finite automata to extract knowledge domains from textual documents. It focuses on identifying multi-word units within terminological ontologies.
Unlike simple words, multi-word units (credit card, for example) possess a monosemic nature and are relatively few and diverse from each other, precisely pinpointing a semantic area.
The algorithm, designed to handle challenges posed by even very long multi-word units composed of a variable number of simple words, integrates selected ontologies into a single finite automaton.
At runtime, it efficiently recognizes and outputs the knowledge domain associated with each multi-word unit, even when they partially or completely overlap.
Benefits of the system include minimal IT maintenance for ontologies, continuous updates without additional computational costs, and no need for software training.
The proposed approach demonstrates robust performance on both short and long documents, validated through tests on multiple textual documents, with a specific test outlined in the paper
Linguistic Text Mining
No full textThis paper explores the challenges of processing the increasing volume of natural language text, which often surpasses traditional methods' real-time processing abilities.
These texts are typically authored by individuals from diverse educational, cultural, and experiential backgrounds.
The paper highlights the main linguistic and semantic issues that arise in the analysis of natural language text.
Linguistic Text Mining is a computational approach that combines linguistic principles with computational techniques to extract high-quality information from natural language texts.
Despite the frequent mentions of ``Linguistic'' and ``Text-Mining'' in scientific literature, no formal definition exists; this paper proposes one. It further explores LTM’s potential in enhancing knowledge extraction by emphasizing linguistic features, such as multi-word units (MWUs).
Traditional text analysis relies heavily on statistical methods, focusing on simple words, which are often polysemous, or on aggregating words without semantic context and this limits systems' ability to interpret domain-specific semantics.
By contrast, MWUs, like ``credit card'', convey specific, unambiguous meanings, critical for identifying specialized domains.
MWUs are typically organized within ontologies that represent distinct knowledge domains.
Building on previous work, the study compares AUTOMETA, an ontology-based approach using finite automata for MWU identification, with large language model (LLM)-based and other ontology-driven Linguistic Text Mining methods.
Findings suggest that integrating linguistic frameworks significantly improves information extraction, offering a deeper understanding of complex language structures
La sorveglianza globale e le tecnologie dell’informazione e della comunicazione
No full textSi affronta qui l’analisi dell’impatto delle nuove tecnologie alla pratica della violazione della privacy. La società nella quale viviamo accumula informazioni sulle persone e ne traccia profili (classificazione) e segue, controlla, registra ogni azione se svolta in spazi aperti al pubblico (sorveglianza).
Nell’articolo viene innanzitutto descritto il più vasto sistema di spionaggio mai realizzato su scala planetaria, il sistema Echelon, e poi vengono descritti altri sistemi in grado di attentare alla privacy. Successivamente, vengono trattati alcuni metodi che permettono di limitare le intrusioni alla privacy. Nelle conclusioni vengono riportate alcune considerazioni su come e quanto i sistemi di sorveglianza globale contrastino con i diritti fondamentali dell’uomo, così come affermati dall’Unione Europea
- …
