Search results for "Natural language"
showing 10 items of 650 documents
Strength Training: Single Versus Multiple Sets
1999
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Using Automatic Morphological Tools to Process Data from a Learner Corpus of Hungarian
2014
The aim of this article is to show how automatic morphological tools originally used to analyze native speaker data can be applied to process data from a learner corpus of Hungarian. We collected written data from 35 students majoring in Hungarian studies at the University of Zagreb, Croatia. The data were analyzed by magyarlanc, a sentence splitter, morphological analyzer, POS-tagger and dependency parser, which found 667 unknown word forms. We investigated the recommendations made by the Hungarian spellchecker hunspell for these unknown words and the correct forms were manually chosen. It was found that if the first suggestion made by hunspell was automatically accepted, an accuracy score…
Machine Learning Models for Measuring Syntax Complexity of English Text
2019
In this paper we propose a methodology to assess the syntax complexity of a sentence representing it as sequence of parts-of-speech and comparing Recurrent Neural Networks and Support Vector Machine. We have carried out experiments in English language which are compared with previous results obtained for the Italian one.
Explaining Causes Behind SQL Query Formulation Errors
2020
This Full Research Paper presents the most prominent query formulation errors in Structured Query Language (SQL), and maps these errors to their cognitive explanations. Understanding query formulation errors is a key to teaching SQL. more effectively. However, studies on what kind of errors novices struggle with are relatively scarce when compared to, for example, programming languages. Although committing errors is a crucial part in learning, some errors are relatively easy to fix, and their commonness is not necessarily an indication of their difficulty. Other errors, however, halt the learning process, and are never fixed by the query writer. Using a previously established error taxonomy…
Semantic Complexity in Natural Language
2015
This chapter presents the technical framework that the authors used to define fragments of natural languages and formulate questions as to their semantic complexity. It examines the study of the classical syllogistic and its extensions. It analyzes the semantic complexity of various salient fragments of English. It highlights that the language of argument, featuring transitive verbs, is in an objective sense inferentially no more complex than the language of classical syllogisms exemplified by argument, indeed, the analogous extension featuring ditransitive verbs involves only a modest increase in complexity. On the other hand, the language of argument, which adds relative clauses to the cl…
Finite groups with all minimal subgroups solitary
2016
We give a complete classification of the finite groups with a unique subgroup of order p for each prime p dividing its order. All the groups considered in this paper will be finite. One of the most fruitful lines in the research in abstract group theory during the last years has been the study of groups in which the members of a certain family of subgroups satisfy a certain subgroup embedding property. The family of the subgroups of prime order (also called minimal subgroups) has attracted the interest of many mathematicians. For example, a well-known result of Itˆo (see [8, Kapitel III, Satz 5.3; 9]) states that a group of odd order with all minimal subgroups in the center is nilpotent. Th…
Noisy Channel in Language-Pair Phenomena Identification
2014
On Prefix Normal Words
2011
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…
The Fuzzy Concept of Idiom and What It Might Mean for Bilingual Dictionaries
2019
Linguistic categories were developed as tools for describing language systems and making them easier to learn. However, like many theoretical concepts and systems, they do not fully represent the real world and, in some cases, seek to imprison linguistic units within a well-ordered system – a procrustean bed as it were. Besides, although the most general categories are universal, the lower-ranking ones are often language-specific. Idiom (or phraseologism) is a very unclear linguistic concept, subject to never-ending debate. However, a strict adherence to categorisation is observable in practical bilingual lexicography and phraseography. This may lead to unwanted compartmentalisation and a…