Search results for "Natural language"
showing 10 items of 650 documents
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
The Phagocyte Lattice of Dyck Words
2006
We introduce a new lattice structure on Dyck words. We exhibit efficient algorithms to compute meets and joins of Dyck words.
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
Finite State Transducers with Intuition
2010
Finite automata that take advice have been studied from the point of view of what is the amount of advice needed to recognize nonregular languages. It turns out that there can be at least two different types of advice. In this paper we concentrate on cases when the given advice contains zero information about the input word and the language to be recognized. Nonetheless some nonregular languages can be recognized in this way. The help-word is merely a sufficiently long word with nearly maximum Kolmogorov complexity. Moreover, any sufficiently long word with nearly maximum Kolmogorov complexity can serve as a help-word. Finite automata with such help can recognize languages not recognizable …
Size of Quantum Finite State Transducers
2007
Sizes of quantum and deterministic finite state transducers are compared in the case when both quantum and deterministic finite state transducers exist. The difference in size may be exponential.
A Metric for Automatic Word categorization
2008
This paper presents a metric to be used by the working prototype WIH (Web Intelligent Handler). This metric (referred here as po) is designed to reflect main topic words and discriminate certain text profiles through word weightings. The actual version is designed only for Spanish web texts. Statistical analyses show that it is possible to differentiate text profiles upon po behavior. A poll is presented also, showing that it is a good main words discriminator. This paper is posted here as a new algorithm useful for Spanish text processing.
A Step Towards a Data Quality Theory
2019
Data quality issues have been topical for many decades. However, a unified data quality theory has not been proposed yet, since many concepts associated with the term “data quality” are not straightforward enough. The paper proposes a user-oriented data quality theory based on clearly defined concepts. The concepts are defined by using three groups of domain-specific languages (DSLs): (1) the first group uses the concept of a data object to describe the data to be analysed, (2) the second group describes the data quality requirements, and (3) the third group describes the process of data quality evaluation. The proposed idea proved to be simple enough, but at the same time very effective in…
GAIML: A New Language for Verbal and Graphical Interaction in Chatbots
2008
Natural and intuitive interaction between users and complex systems is a crucial research topic in human-computer interaction. A major direction is the definition and implementation of systems with natural language understanding capabilities. The interaction in natural language is often performed by means of systems called chatbots. A chatbot is a conversational agent with a proper knowledge base able to interact with users. Chatbots appearance can be very sophisticated with 3D avatars and speech processing modules. However the interaction between the system and the user is only performed through textual areas for inputs and replies. An interaction able to add to natural language also graph…
The effects of training on the grammar of preschool children
1974
The acquisition of morphological and syntactic rules of language during early childhood has been the object of intensive study in many languages during the last few years. As regards English, some surveys have already been published on the results (McNeill, 1970; Slobin, 1971). Research on the acquisition of morphological and syntactic patterns has been influenced on the one hand by psycholinguistics, on the other by the psychology of learning. This duality of starting points manifests itself also in the way of presenting problems and in the interpretation of results. One of the methodological difficulties when studying the acquisition of grammar was for a long time how to separate those la…