Search results for " Natural Language"
showing 10 items of 192 documents
The geometry of surfaces in 4-space from a contact viewpoint
1995
We study the geometry of the surfaces embedded in ℝ4 through their generic contacts with hyperplanes. The inflection points on them are shown to be the umbilic points of their families of height functions. As a consequence we prove that any generic convexly embedded 2-sphere in ℝ4 has inflection points.
Towards Diagrammatic Patterns
2008
This article presents the idea that the graphical representation (concrete syntax) of a visual language can be specified based on some pre-defined diagrammatic patterns. A diagram from the Specification and Description Language (SDL) is used as illustration.
A practical solution to the problem of automatic word sense induction
2004
Recent studies in word sense induction are based on clustering global co-occurrence vectors, i.e. vectors that reflect the overall behavior of a word in a corpus. If a word is semantically ambiguous, this means that these vectors are mixtures of all its senses. Inducing a word's senses therefore involves the difficult problem of recovering the sense vectors from the mixtures. In this paper we argue that the demixing problem can be avoided since the contextual behavior of the senses is directly observable in the form of the local contexts of a word. From human disambiguation performance we know that the context of a word is usually sufficient to determine its sense. Based on this observation…
"Table 1" of "Search for promptly produced heavy quarkonium states in hadronic Z decays"
1996
The analysis of hadrons (from X) provides to distinguish of the various decay modes of Z-boson (see text).
A recurrent deep neural network model to measure sentence complexity for the Italian Language
2019
Text simplification (TS) is a natural language processing task devoted to the modification of a text in such a way that the grammar and structure of the phrases is greatly simplified, preserving the underlying meaning and information contents. In this paper we give a contribution to the TS field presenting a deep neural network model able to detect the complexity of italian sentences. In particular, the system gives a score to an input text that identifies the confidence level during the decision making process and that could be interpreted as a measure of the sentence complexity. Experiments have been carried out on one public corpus of Italian texts created specifically for the task of TS…
Unambiguous recognizable two-dimensional languages
2006
We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.
Are tools all we need? Digital Humanities in the time of its institutionalisation
2011
Three key features of the Digital Humanities today are its quantitative growth, its institutionalisation and its definition as a discipline. In the first part of this article (2. Institutional models) I shall pinpoint some models of institutionalisation that are emerging in the international scenario. Against this background, I shall then discuss (3. Tools) some concepts central to Digital Humanities’ self-definition, such as those of practice, ‘building’, centre, project, product and tools, particularly questioning the opinion that the creation of friendly digital tools is the key issue in the future of the field. I shall finally suggest that ‘instrumentalism’, ‘project fever’ and an exces…
On the Shuffle of Star-Free Languages
2012
Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.
Verbal sets and cyclic coverings
2010
Abstract We consider groups G such that the set of all values of a fixed word w in G is covered by a finite set of cyclic subgroups. Fernandez-Alcober and Shumyatsky studied such groups in the case when w is the word [ x 1 , x 2 ] , and proved that in this case the corresponding verbal subgroup G ′ is either cyclic or finite. Answering a question asked by them, we show that this is far from being the general rule. However, we prove a weaker form of their result in the case when w is either a lower commutator word or a non-commutator word, showing that in the given hypothesis the verbal subgroup w ( G ) must be finite-by-cyclic. Even this weaker conclusion is not universally valid: it fails …
Combinatorics of Finite Words and Suffix Automata
2009
The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.