AI For Business Analytics

AI For Business Analytics — independent reviews, comparisons, pricing and step-by-step guides on Aizhi.

Imieliński–Lipski algebra

In database theory, Imieliński–Lipski algebra is an extension of relational algebra onto tables with different types of null values. It is used to operate on relations with incomplete information. Imieliński–Lipski algebras are defined to satisfy precise conditions for semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on relations to operators on relations with various kinds of "null values". These conditions require that the system be safe in the sense that no incorrect conclusion is derivable by using a specified subset F of the relational operators; and that it be complete in the sense that all valid conclusions expressible by relational expressions using operators in F are in fact derivable in this system. For example, it is well known that the three-valued logic approach to deal with null values, supported treatment of nulls values by SQL is not complete, see Ullman book. To show this, let T be: Take SQL query Q SQL query Q will return empty set (no results) under 3-valued semantics currently adopted by all variants of SQL. This is the case because in SQL, NULL is never equal to any constant – in this case, neither to “Spring” nor “Fall” nor “Winter” (if there is Winter semester in this school). NULL='Spring' will evaluate to MAYBE and so will NULL='Fall'. The disjunction MAYBE OR MAYBE evaluates to MAYBE (not TRUE). Thus Igor will not be part of the answer (and of course neither will Rohit). But Igor should be returned as the answer. Indeed, regardless what semester Igor took the Networks class (no matter what was the unknown value of NULL), the selection condition will be true. This “Igor” will be missed by SQL and the SQL answer would be incomplete according to completeness requirements specified in Tomasz Imieliński, Witold Lipski, 'Incomplete Information in Relational Databases'. It is also argued there that 3-valued logic (TRUE, FALSE, MAYBE) can never provide guarantee of complete answer for tables with incomplete information. Three algebras which satisfy conditions of safety and completeness are defined as Imielinski–Lipski algebras: the Codd-Tables algebra, the V-tables algebra and the Conditional tables (C-tables) algebra. == Codd-tables algebra == Codd-tables algebra is based on the usual Codd's single NULL values. The table T above is an example of Codd-table. Codd-table algebra supports projection and positive selections only. It is also demonstrated in [IL84 that it is not possible to correctly extend more relational operators over Codd-Tables. For example, such basic operation as join is not extendable over Codd-tables. It is not possible to define selections with Boolean conditions involving negation and preserve completeness. For example, queries like the above query Q cannot be supported. In order to be able to extend more relational operators, more expressive form of null value representation is needed in tables which are called V-table. == V-tables algebra == V-tables algebra is based on many different ("marked") null values or variables allowed to appear in a table. V-tables allow to show that a value may be unknown but the same for different tuples. For example, in the table below Gaurav and Igor order the same (but unknown) beer in two unknown bars (which may, or may not be different – but remain unknown). Gaurav and Jane frequent the same unknown bar (Y1). Thus, instead one NULL value, we use indexed variables, or Skolem constants . V-tables algebra is shown to correctly support projection, positive selection (with no negation occurring in the selection condition), union, and renaming of attributes, which allows for processing arbitrary conjunctive queries. A very desirable property enjoyed by the V-table algebra is that all relational operators on tables are performed in exactly the same way as in the case of the usual relations. === Conditional tables (c-tables) algebra === Example of conditional table (c-table) is shown below. It has additional column “con” which is a Boolean condition involving variables, null values – same as in V-tables. over the following table c-table Conditional tables algebra, mainly of theoretical interest, supports projection, selection, union, join, and renaming. Under closed-world assumption, it can also handle the operator of difference, thus it can support all relational operators. == History == Imieliński–Lipski algebras were introduced by Tomasz Imieliński and Witold Lipski Jr. in Incomplete Information in Relational Databases.
Read more →
Top 10 AI Logo Makers Compared (2026)

In search of the best AI logo maker? An AI logo maker is software that uses machine learning to help you get more done — it turns a rough idea into a polished result in seconds. When choosing one, weigh output quality, pricing, export formats, and how well it fits the tools you already use. Whether you are a beginner or a pro, the right AI logo maker slots into your workflow and pays for itself fast. We tested the leading options and ranked them by quality, value, and ease of use.
Read more →
Mirella Lapata

Mirella Lapata is a computer scientist and Professor in the School of Informatics at the University of Edinburgh. Working on the general problem of extracting semantic information from large bodies of text, Lapata develops computer algorithms and models in the field of natural language processing (NLP). == Education == Lapata obtained a Master of Arts (MA) degree from Carnegie Mellon University and subsequently earned a doctorate from the University of Edinburgh. Lapata's doctoral research investigated the acquisition of information from polysemous linguistic units using probabilistic methods supervised by Alex Lascarides, Chris Brew and Steve Finch. == Career and research == After her doctorate, Lapata assumed academic positions at Saarland University and at the Department of Computer Science at the University of Sheffield. At the University of Edinburgh she became a reader in the School of Informatics where she is a full Professor and holds a personal chair in natural language processing. Lapata is a member of the Human Communication Research Center and Institute for Language, Cognition and Computation, both in Edinburgh. Between 2015 and 2017, Lapata served as a member of the Royal Society Machine Learning Working Group. Recently Lapata was granted a European Research Council (ERC) Consolidator Grant worth €1.9M to fund five years of her project, TransModal: Translating from Multiple Modalities into Text. === Awards and honours === In 2009 Lapata became the first recipient of the Microsoft British Computer Society (BCS)/BCS IRSG Karen Spärck Jones Award. The award recognises achievement in furthering the progress in information retrieval and natural language processing; the award commemorates the life and work of Karen Spärck Jones. In 2012 Lapata won an Empirical Methods in Natural Language Processing (EMNLP)-CoNLL 2012 Best Reviewer Award. In 2018 Lapata was awarded, alongside Li Dong, an Association for Computational Linguistics (ACL) Best Paper Honorable Mention. In 2019 Lapata was elected a Fellow of the Royal Society of Edinburgh In 2020 Lapata was elected to the Academia Europaea. In 2025 Lapata was awarded the BCS Lovelace Medal for Computing Research.
Read more →
Global Language Monitor

The Global Language Monitor (GLM) is a company based in Austin, Texas, that analyzes trends in the English language. == History == Founded in Silicon Valley in 2003 by Paul J.J. Payack, the GLM describes its role as "a media analytics company that documents, analyzes and tracks cultural trends in language the world over, with a particular emphasis upon International and Global English". In April 2008, GLM moved its headquarters from San Diego to Austin. In July 2020, GLM announced that the word covid was its Top Word of 2020 for English. The company has been repeatedly criticized by linguists for promoting misinformation about language. Writing on Language Log, the linguist Ben Zimmer accused it of "hoodwink[ing] unsuspecting journalists on a range of pseudoscientific claims".
Read more →
BioBIKE

BioBike(nee. BioLingua ) is a cloud-based, through-the-web programmable (Paas) symbolic biocomputing and bioinformatics platform that aims to make computational biology, and especially intelligent biocomputing (that is, the application of Artificial Intelligence to computational biology) accessible to research scientists who are not expert programmers. == Unique capabilities == BioBIKE is an integrated symbolic biocomputing and bioinformatics platform, built from the start as an entirely (what is now called) cloud-based architecture where all computing is done in remote servers, and all user access is accomplished through web browsers. BioBIKE has a built-in frame system in which all objects, data, and knowledge are represented. This enables code written either in the native Lisp, in the visual programming language, or systems of rules expressed in the SNARK theorem prover to access the whole of biological knowledge in an integrated manner. For its time (released in 2002) it was unique in permitting users to create fully functional biocomputing programs that run on the back-end servers entirely through the web browser UI. (In modern terms it was one of the first PaaS (Platform as a Service) systems, predating even Salesforce in this capability.) Initially this programming was carried out in raw Lisp, but Jeff Elhai's team at VCU, with NSF funding, created an entirely graphical programming environment on top of BioBIKE based upon the Boxer-style programming environments. Being a multi-headed, multi-threaded, multi-user, multi-tenancy cloud-based system, BioBIKE users were able to directly work together through their web browsers, remotely sharing the same listener and memory space. This permitted a unique sort of collaboration, discussed in Shrager (2007). A specialized offshoot of BioBIKE called "BioDeducta" includes SRI's SNARK theorem prover, offering unique "deductive biocomputing" capabilities. == Implementation == BioBIKE is open-source software implemented using the Lisp programming language. Continuing development takes place by the BioBIKE team centered at Virginia Commonwealth University . == History == BioBIKE was originally called "BioLingua", and was developed by Jeff Shrager at The Carnegie Inst. of Washington Dept. of Plant Biology, and JP Massar with funding from NASA's Astrobiology Division. Shrager and Massar wanted to create a web-based, multi-user Lisp Machine, specialized for bioinformatics. Other early contributors to the project included Mike Travers, and Jeff Elhai of VCU. Elhai obtained continuing funding from the National Science Foundation for the project, which was renamed BioBIKE. Elhai and colleagues added BioBIKE's unique visual programming language. Shrager, meanwhile, collaborated with Richard Waldinger at SRI to build SRI's (SNARK) theorem prover into BioBIKE, creating a deductive biocomputing system, called BioDeducta. == Instances == There used to be a number of BioBIKE verticals in different biological domains, including viral pathogens, cyanobacteria and other bacteria, Arabidopsis thaliana, and several others described in the references.
Read more →
Hanna Hajishirzi

Hannaneh Hajishirzi is an Iranian-American computer scientist specializing in natural language processing. She is Torode Family Professor in Computer Science & Engineering in the Paul G. Allen School of Computer Science and Engineering at the University of Washington, head of the H2Lab in the Allen School, and a senior director of natural language processing in the Allen Institute for AI. == Education and career == After a bachelor's degree from the Sharif University of Technology, Hajishirzi completed her Ph.D. in computer science in 2011, at the University of Illinois Urbana-Champaign. Her dissertation, Action-Centered Reasoning for Probabilistic Dynamic Systems, was supervised by Eyal Amir. After postdoctoral research at Disney Research in Pittsburgh, Hajishirzi joined the University of Washington in 2012, as a research scientist in electrical engineering. In 2015 she became a research assistant professor in electrical engineering. She obtained a regular-rank assistant professorship in 2018, at the same time becoming an AI Fellow in the Allen Institute for AI, where she became a senior director of research in 2021. She was promoted to associate professor in 2022 and to full professor in 2025. == Recognition == Hajishirzi was named as a Fellow of the Association for Computational Linguistics in 2025, "for significant contributions to question answering, scientific applications, multimodal artificial intelligence, and fully open language models". == Personal life == Hajishirzi is married to Ali Farhadi, the CEO of the Allen Institute for AI.
Read more →
Best AI Voice Assistants in 2026

Trying to pick the best AI voice assistant? An AI voice assistant is software that uses machine learning to help you get more done — it scales effortlessly from a single task to thousands. The best picks balance beginner-friendly simplicity with the depth power users need, and they ship updates often. Whether you are a beginner or a pro, the right AI voice assistant slots into your workflow and pays for itself fast. This guide breaks down the top picks, their pros and cons, and who each one is best for.
Read more →
PROMT

ProMT is a lead Russian developer of language translation software for businesses and private users since 1991. The company provides on-premises software based on neural technologies. == History == On March 6, 1998, ProMT launched a free online translation services, which is now known as PROMT.One. In 1997, ProMT and the French company Softissimo developed a line of products for the European company Reverso. == Technology == Historically, ProMT systems used rule-based machine translation (RBMT) technology. In 2011 a hybrid approach which combined rule-based and statistical MT was implemented. In 2019, ProMT introduced its new neural technology and flagship solution - PROMT Neural Translation Server. Since then all MT systems developed by ProMT are based on neural machine translation. The software can run on Microsoft Windows, Linux, MacOS, iOS and Android and works in offline mode providing secure machine translation. As of 2025, it translates 62 languages from and to English, German, and Russian.
Read more →
Meta AI

Meta AI is a research division of Meta (formerly Facebook) that develops artificial intelligence and augmented reality technologies. == History == Meta AI was founded in 2013 as Facebook Artificial Intelligence Research (FAIR). It has workspaces in Menlo Park, London, New York City, Paris, Seattle, Pittsburgh, Tel Aviv, and Montreal as of 2025. In 2016, FAIR partnered with Google, Amazon, IBM, and Microsoft in creating the Partnership on Artificial Intelligence to Benefit People and Society. Meta AI was directed by Yann LeCun until 2018, when Jérôme Pesenti succeeded the role. Pesenti is formerly the CTO of IBM's big data group. FAIR's research includes self-supervised learning, generative adversarial networks, document classification and translation, and computer vision. FAIR released Torch deep-learning modules as well as PyTorch in 2017, an open-source machine learning framework, which was subsequently used in several deep learning technologies, such as Tesla's autopilot and Uber's Pyro. That same year, a pair of chatbots were falsely rumored to be discontinued for developing a language that was unintelligible to humans. FAIR clarified that the research had been shut down because they had accomplished their initial goal to understand how languages are generated by their models, rather than out of fear. FAIR was renamed Meta AI following the rebranding that changed Facebook, Inc. to Meta Platforms Inc. On October 1, 2025, Facebook announced "We will soon use your interactions with AI at Meta to personalize the content and ads you see". == Virtual assistant == Meta AI is also the name of the virtual assistant developed by the team, now integrated as a chatbot into Meta's social networking products. It is also available as a subscription-based stand-alone app. The virtual assistant was pre-installed on the second generation of Ray-Ban Meta smartglasses, and can incorporate inputs from the glasses' cameras after an update. It is also available on Quest 2 and newer HMDs. Since May 2024, the chatbot has summarized news from various outlets without linking directly to original articles, including in Canada, where news links are banned on its platforms. This use of news content without compensation and attribution has raised ethical and legal concerns, especially as Meta continues to reduce news visibility on its platforms. == Current research == === Natural language processing and chatbot === Natural language processing is the ability for machines to understand and generate natural language. The team is also researching unsupervised machine translation and multilingual chatbots. ==== Galactica ==== Galactica is a large language model (LLM) designed for generating scientific text. It was available for three days from 15 November 2022, before being withdrawn for generating racist and inaccurate content. ==== Llama ==== Llama is an LLM released in February 2023. As of January 2026, the most recent release is the Llama 4. === Hardware === Meta used CPUs and in-house custom chips before 2022; they switched to Nvidia GPUs since then. MTIA v1, one of their early chips, is designed for the company's content recommendation algorithms. It was fabricated on TSMC's 7 nm process technology and consumed 25W, capable of 51.2 TFlops FP16. == Controversy == The French media outlet Mediapart reports that in 2022, Facebook's parent company illegally used works accumulated by the pirate site LibGen to train its artificial intelligence.
Read more →
Pascale Fung

Pascale Fung (馮雁) (born in Shanghai, China) is a co-founder and Chief Research and Innovation Officer of AMI Labs, an artificial intelligence research company focused on world models. She is a professor in the Department of Electronic & Computer Engineering and the Department of Computer Science & Engineering at the Hong Kong University of Science & Technology(HKUST). She is the director of the Centre for AI Research (CAiRE) at HKUST. She is an elected Fellow of the Institute of Electrical and Electronics Engineers (IEEE) for her “contributions to human-machine interactions”, an elected Fellow of the International Speech Communication Association for “fundamental contributions to the interdisciplinary area of spoken language human-machine interactions” and an elected Fellow of the Association for Computational Linguistics (ACL) for her “significant contributions toward statistical NLP, comparable corpora, and building intelligent systems that can understand and empathize with humans”. She is a member of the Global Future Council on Artificial Intelligence and Robotics, a think tank of the World Economic Forum, and blogs for the Forum's online publication Agenda. She is a member of the Partnership on AI. She has been invited as an AI expert to different government initiatives in China, Japan, the UAE, India, the European Union and the United Nations. Fung's publication topics include spoken language systems, natural language processing, and empathetic human-robot interaction. She co-founded the Human Language Technology Center (HLTC) and is an affiliated faculty with the Robotics Institute and the Big Data Institute, both at HKUST. Additionally, she is the founding chair of the Women Faculty Association at HKUST. She is actively involved in encouraging young women into careers in engineering and science. == Career and research interests == Fung's work is focused on building systems that try to understand and empathize with humans. She has authored and co-authored hundreds of publications, along with many journal listings and book chapters. Fung is often found in the media, among others as a writer for Scientific American, the World Economic Forum, and the London School of Economics, and the Design Society. She was a pioneer in using statistical models for natural language understanding. Her PhD thesis proposed unsupervised methods for aligning texts and mining dictionary translations in different languages by distributional properties. She is an expert in spoken language understanding and computer emotional intelligence, and is a strong proponent of technology transfer. Fung has applied many of her research group's results in the fields of, among others, robotics, IoT, and financial analytics. Her efforts led to the launch of the world's first Chinese natural language search engine in 2001, the first Chinese virtual assistant for smartphones in 2010, and the first emotional intelligent speaker in 2017. == Honors == Elected Fellow, Association for the Advancement of Artificial Intelligence (AAAI), for “significant contributions to the field of Conversational AI and to the development of ethical AI principles and algorithms” Elected Fellow, Association for Computational Linguistics (ACL), for “significant contributions toward statistical NLP, comparable corpora, and building intelligent systems that can understand and empathize with humans” Nominee, the VentureBeat AI Innovation Awards at Transform 2020, for "AI for Good" Awardee, 2017 Outstanding Women Professionals & Entrepreneurs Award, Hong Kong Women Professionals & Entrepreneurs Association Elected Fellow, Institute of Electrical and Electronics Engineers (IEEE), for “contributions to human-machine interactions” Elected Fellow, International Speech Communication Association (ISCA), for “fundamental contributions to the interdisciplinary area of spoken language human-machine interactions" Member, Global Future Council on AI and Robotics, World Economic Forum (2016–) One of the Top 50 Women of Hope, selected by List Magazine in 2014 Selected as “My Favorite Teacher” by top engineering students in 2007 and in 2009 == Affiliations == Fung is affiliated with the following institutions and organizations: Hong Kong University of Science and Technology World Economic Forum Institute of Electrical and Electronics Engineers Association for Computational Linguistics International Speech Communication Association Association for Computing Machinery Association for the Advancement of Artificial Intelligence
Read more →
Luca Maria Gambardella

Luca Maria Gambardella (born 4 January 1962) is an Italian computer scientist and author. He is the former director of the Dalle Molle Institute for Artificial Intelligence Research in Lugano, in the Ticino canton of Switzerland. He is currently the prorector of Università della Svizzera italiana, where he directs the Master of Science in Artificial Intelligence degree course. Several of his papers have been extensively cited, with his collaborators including Marco Dorigo, with whom he has published papers on the application of ant colony optimization theory to the traveling salesman problem, and Jürgen Schmidhuber with whom he has published research on deep neural networks.. Beside working in research, Gambardella explores the potentials of AI applied for the generation of art. Some of his artistic installations received significant media coverage. As a novelist, the genres he approached broad from Bildungsroman of his first book "Sei vite" ("Six lives"), to romance of his second book "Il suono dell'alba" ("The sound of sunrise").
Read more →
Struc2vec

struc2vec is a framework to generate node vector representations on a graph that preserve the structural identity. In contrast to node2vec, that optimizes node embeddings so that nearby nodes in the graph have similar embedding, struc2vec captures the roles of nodes in a graph, even if structurally similar nodes are far apart in the graph. It learns low-dimensional representations for nodes in a graph, generating random walks through a constructed multi-layer graph starting at each graph node. It is useful for machine learning applications where the downstream application is more related with the structural equivalence of the nodes (e.g., it can be used to detect nodes in networks with similar functions, such as interns in the social network of a corporation). struc2vec identifies nodes that play a similar role based solely on the structure of the graph, for example computing the structural identity of individuals in social networks. In particular, struc2vec employs a degree-based method to measure the pairwise structural role similarity, which is then adopted to build the multi-layer graph. Moreover, the distance between the latent representation of nodes is strongly correlated to their structural similarity. The framework contains three optimizations: reducing the length of degree sequences considered, reducing the number of pairwise similarity calculations, and reducing the number of layers in the generated graph. struc2vec follows the intuition that random walks through a graph can be treated as sentences in a corpus. Each node in a graph is treated as an individual word, and short random walk is treated as a sentence. In its final phase, the algorithm employs Gensim's word2vec algorithm to learn embeddings based on biased random walks. Sequences of nodes are fed into a skip-gram or continuous bag of words model and traditional machine-learning techniques for classification can be used. It is considered a useful framework to learn node embeddings based on structural equivalence.
Read more →
Grokking (machine learning)

In machine learning, grokking, or delayed generalization, is a phenomenon observed in some settings where a model abruptly transitions from overfitting (performing well only on training data) to generalizing (performing well on both training and test data), after many training iterations with little or no improvement on the held-out data. This contrasts with what is typically observed in machine learning, where generalization occurs gradually alongside improved performance on training data. == Origin == Grokking was introduced by OpenAI researcher Alethea Power and colleagues in the January 2022 paper "Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets". It is derived from the word grok coined by Robert Heinlein in his novel Stranger in a Strange Land. In ML research, "grokking" is not used as a synonym for "generalization"; rather, it names a sometimes-observed delayed‑generalization training phenomenon in which training and held‑out performance do not improve in tandem, and in which held‑out performance rises abruptly later. Authors also analyze the "grokking time", the epoch or step at which this transition occurs in those scenarios. == Interpretations == Grokking can be understood as a phase transition during the training process. In particular, recent work has shown that grokking may be due to a complexity phase transition in the model during training. While grokking has been thought of as largely a phenomenon of relatively shallow models, grokking has been observed in deep neural networks and non-neural models and is the subject of active research. One potential explanation is that the weight decay (a component of the loss function that penalizes higher values of the neural network parameters, also called regularization) slightly favors the general solution that involves lower weight values, but that is also harder to find. According to Neel Nanda, the process of learning the general solution may be gradual, even though the transition to the general solution occurs more suddenly later. Recent theories have hypothesized that grokking occurs when neural networks transition from a "lazy training" regime where the weights do not deviate far from initialization, to a "rich" regime where weights abruptly begin to move in task-relevant directions. Follow-up empirical and theoretical work has accumulated evidence in support of this perspective, and it offers a unifying view of earlier work as the transition from lazy to rich training dynamics is known to arise from properties of adaptive optimizers, weight decay, initial parameter weight norm, and more. This perspective is complementary to a unifying "pattern learning speeds" framework that links grokking and double descent; within this view, delayed generalization can arise across training time ("epoch‑wise") or across model size ("model‑wise"), and the authors report "model‑wise grokking".
Read more →
General Regionally Annotated Corpus of Ukrainian

General Regionally Annotated Corpus of the Ukrainian Language (GRAC, Ukrainian: Генеральний регіонально анотований корпус української мови, romanized: Heneralnyi rehionalno anotovanyi korpus ukrainskoi movy, ГРАК, Ukrainian грак for rook) is a text corpus of the Ukrainian language comprising more than 2 billion tokens, intended for linguistic research in grammar, vocabulary, and the history of the Ukrainian literary language, as well as for use in compiling dictionaries and grammars. The corpus can be used for language study and also for preparing teaching materials, textbooks, learner’s dictionaries, and exercises using examples from real texts, taking into account frequency and collocational patterns, and so on. The corpus is not a model of standard Ukrainian: it may contain words and combinations that do not match current norms of the literary language. The corpus covers the period from 1816 to 2025, and as of 29 November 2025 it contains more than 812,000 texts by about 35,000 authors. == Composition of the corpus == In the 10th version of the corpus, available for searching from 20 October 2020, 35% consists of fiction. Some fiction genres are highlighted separately: children’s literature, folklore, dramatic works, and scripts. Among non-fiction texts: journalistic writing, including newspaper collections from 1888–1893, 1905, 1913–1918, 1919–1943, modern newspapers from different regions, and texts from online news/information sites; memoirs, letters, and diaries, including a sizeable corpus of Facebook texts representing blogs by people from all regions of Ukraine and the diaspora; scholarly and educational texts: monographs, dissertations, academic articles, textbooks; large subcorpora of academic literature in history, ethnography, philosophy, and law are singled out separately; religious texts, including two Ukrainian translations of the Bible; speeches and interviews. Some dictionaries that include phrasal examples and phraseology have also been incorporated, including the Ukrainian dictionary by Borys Hrinchenko and the Russian-Ukrainian idiomatic dictionary by I. Vyrhan and M. Pylynska. Using the corpus tools, these dictionaries can be searched not only for words, but also for lexico-grammatical patterns within examples and phraseological expressions. About 20% of the texts in the corpus are translations. The corpus includes translations from more than 80 languages, most of all from English and Russian. == Dating == Texts in the corpus are dated by the year of writing, or by the latest year in which a work could have been written; translated texts are dated by the year the translation was produced. A publication year may also be indicated, corresponding to the edition from which the text is taken. == Regional annotation == The corpus’s regional annotation is based on the modern administrative division of Ukraine. The corpus includes texts from all oblasts of Ukraine and from Crimea. A single text may belong to several regional subcorpora (if the author or translator was born, studied, or lived for a long time in different regions). In addition to regional subcorpora, there are subcorpora of works by authors of the Ukrainian diaspora (USA, Canada, Poland, Germany, the United Kingdom, France, etc.). These are mostly texts by emigrants of the 1940s, and to a lesser extent of 1917–1920s. == Morphological annotation == GRAC is based on the morphological analysis system nlp_uk, developed by specialists from the r2u group. The program analyzes the text and, for each word form, determines the lemma (lexeme) and tags (grammatical features). == Research based on the corpus == Research on the Ukrainian language has been carried out using the corpus, including studies of the historical dynamics of language norms, and letter and letter-combination frequencies for font development.
Read more →
Angelo Dalli

Angelo Dalli (born 14 April 1978) is a computer scientist specialising in artificial intelligence, a serial entrepreneur, and business angel investor. == Early life and education == Dalli was born in Malta and grew up in the town of Birżebbuġa. Dalli was educated at the Archbishop's Seminary, Malta and represented Malta in the Young European Environmental Research contest held in Cologne in 1994. Dalli represented Malta in the International Olympiad in Informatics held in Eindhoven in 1995, where he won a bronze medal. Dalli started selling computer software as a teenager, and worked for the International Data Group as a freelance contributor for PC World. == Academic work == After graduating from the University of Malta, Dalli spent time lecturing on artificial intelligence and natural language processing before reading for his PhD at the University of Sheffield under the supervision of Yorick Wilks. Dalli has published over 23 peer reviewed papers in the artificial intelligence and natural language processing fields, including one of the earliest methods on timestamp extraction from documents that is now commonly used in most email applications. Angelo has also contributed to the encoding of European languages in Unicode, in particular for the Common Locale Data Repository. In the field of Bioinformatics Dalli has found a particularly useful integer sequence (sequence A062208 in the OEIS) which efficiently computes all alignments of strings of length 3 together with other generalisations (sequence A062204 in the OEIS), (sequence A062205 in the OEIS) for applications in natural language and sequence alignment. Dalli has an Erdős number of 3. Dalli has led the Maltese national informatics team in the International Olympiad in Informatics at IOI 2002 in Seoul, South Korea and IOI 2004 in Athens, Greece. == Artificial intelligence == === Trustworthy AI and Hybrid Intelligence === Angelo has been a vocal proponent of trustworthy AI that impacts society positively and believes that AI should be properly regulated. Angelo has co-founded UMNAI in 2019, with the aim of creating a new form of trustworthy AI that can explain the decisions and steps that the AI has taken to output an answer, based on a neurosymbolic AI architecture that combines neural and symbolic AI in an auditable and certain manner. === AI and society === Angelo led the Government of Malta taskforce that produced Malta's new AI regulation and national AI strategy, and is an active member of the IEEE, AAAI, ACM and the ACL. === AI in transport === Angelo had led the introduction of different machine learning techniques in intelligent transport systems (ITS), including parking, controlled vehicle access zones and dynamic traffic interchange control. His intelligent transport company, Traffiko, operated in Europe, Australia and the Middle East, and was eventually sold to Q-Free in Norway in 2015. === AI in gaming === Angelo is a well known speaker in the online gambling industry. Angelo setup one of the first companies that applied artificial intelligence in the online gambling industry, called Bit8 (now part of Intralot), with the most notable work being on algorithms that estimate and maximise player lifetime value and personalised bonusing systems. These techniques have since been widely adopted by the online gambling industry Intralot subsequently bought Bit8 in 2017. === AI and creativity === Angelo has been collaborating various artists and creatives to teach AI about creativity. The results of this collaboration is the UMA AI entity, short for Universal Machine Artist. Angelo has also co-founded the Creative Science and Arts Institute to act as a foundation for future research into AI, science, technology and creativity. UMA is creating original artwork using a modified Generative adversarial network has a third component, the human artist, to produce different learning results than standard generative AI models. The underlying discriminator in UMA started from an anti-fraud detection system and has now gradually evolved to add stable diffusion and procedural generation methods. The first two artworks generated by UMA were auctioned in October and November 2018 respectively, with all proceeds donated to charity and good causes. Ongoing work in improving UMA and furthering collaboration with other artists is ongoing. Notable exhibitions include Tomorrow's Blossoms with Selina Scerri at Esplora Museum in 2024, which explored the theme of AI and emotions. == Angel investor == Angelo is an angel investor active in the high-tech startup scene, and is a member of EBAN, and World Business Angel Forum senator. Angelo has been encouraging Maltese startups via various public events including the Zest and Budding Rockstars conferences and co-founded BAM, the Malta Business Angel network, in 2019. == Awards and honours == === Entrepreneurial and scientific === Bronze Medal, International Olympiad in Informatics (1995) Malta Top Entrepreneur Award (2019) Malta Top Entrepreneur Award (2014) WIPO IP Enterprise Award for the UMNAI Neuro-symbolic AI architecture (2022) === Corporate awards === Intralot Bit8 EGR Rising Star Award (2014) Intralot Bit8 Malta Communication Authority eBusiness Award for the Best B2B application (2015) Intralot Bit8 Malta iGaming Award for Excellence (2017)
Read more →