A lexeme can be represented as a vector in a Hilbert space. Each element of the vector represents the weight of a semantic relation with a second vector: the context of a second lexeme. Two query operators are defined in a way that they attribute the value +1 to the component of the state that corresponds to the word meaning we are interested in, and -1 in the orthogonal direction. Entangled states have been used to detect semantic relationships in Information Retrieval (IR). In particular, since the first operator corresponds to negation and the conditional gate corresponds to an implication in classical logic, they can represent two basic semantic relationships : hyponymy (e.g. genus-species) and antonymy (e.g. masculine-feminine). In fact, according to Semantics, if A and B are antonymic terms, then A is an hyponym of (i.e. implies) not-B as in the Gremias semiotic square. We underline how the relations of a given semantic universe, and the corresponding result of our operators, depends only on the considered text. Among others, this analogy suggests the application of quantum-based models to language and IR.
A lexeme can be represented as a vector in a Hilbert space. Each element of the vector represents the weight of a semantic relation with a second vector: the context of a second lexeme. Two query operators are defined in a way that they attribute the value +1 to the component of the state that corresponds to the word meaning we are interested in, and -1 in the orthogonal direction. Entangled states have been used to detect semantic relationships in Information Retrieval (IR). In particular, since the first operator corresponds to negation and the conditional gate corresponds to an implication in classical logic, they can represent two basic semantic relationships : hyponymy (e.g. genus-species) and antonymy (e.g. masculine-feminine). In fact, according to Semantics, if A and B are antonymic terms, then A is an hyponym of (i.e. implies) not-B as in the Gremias semiotic square. We underline how the relations of a given semantic universe, and the corresponding result of our operators, depends only on the considered text. Among others, this analogy suggests the application of quantum-based models to language and IR.
Purpose The paper aims to provide a semiotic interpretation of the role played by entanglement in quantum-based models aimed to information retrieval and suggests possible improvements. Actual models are capable of retrieving documents relevant to a query composed of a keyword and its acceptation expressed by a given context. The paper also considers some analogies between this technique and quantum-based approaches in other disciplines to discuss the consequence of this quantum turn, as epistemology and philosophy of language are concerned. Design/methodology/approach We use quantum geometry to design a formal model for textual semiotics. In particular, the authors refer to Greimas’s work on semantics and information theory, to Eco’s writings on semantic memory and to Lotman’s work on a cybernetic notion of culture. Findings Quantum approaches imply a particular point of view on meaning. Meaning is not a real, positive quality of a given word. It is a net of relations constructed in the text, whose value is progressively determined during the reading process. Furthermore, reading is not a neutral operation: to read is to determine meaning. If it is said that, from a general semiotic point of view, meaning is stored in quantum semantic memories and is read/written by semantic machines, then the operation of “reading/writing” is analogous to the operation of measuring in quantum theory: in other terms, meaning is a value, and this implies an instance (not necessarily human) according to which values are valuable. Research limitations/implications The authors are not proposing a complete quantum semantics. At the present, quantum information retrieval can detect the presence of semantic relations. The authors suggest a way to characterize them, leaving open the problem on how to formalize the document as a vector in four-state semantic space. Practical implications A quantum turn shows deep semiotic implications on the approach to language, which shows an immanent semantic organization not reducible to syntax and morphology. This organization is probabilistic and indeterministic and explains to what extent text fixes the meaning of its lexical units. Social implications In the authors’ perspective, signification is not the exclusivity of a human subject. Criticizing Turing test, the great semiotic and cybernetic scholar Jurij Lotman wrote that if we identify “intelligent” and “human”, we raise the failings of an actual form of intelligence to the rank of an essential characteristic. On this line, meaning is considered as a feature of social, artificial and biological systems. Originality/value The adoption of quantum formalism seems in line with cybernetic framework, involving a probabilistic, non-cartesian point of view on meaning aimed to critically discuss the human–machine relation. Furthermore, Quantum theory (QT) implies a phenomenological point of view on the conditions of possibility of meaning.
Big Data re-opened the debate between deterministic and probabilistic methods in linguistics. Semantics seems to be a promising field for their application: Greimas observed how semantic layers are stabilized in a document thanks to redundancy, thus transmitting less information. For example, the context stabilizes one of the possible meanings of ambiguous syntactic structures such as “the chicken is ready to eat.” by reducing the probability of the other meanings.Among different probabilistic algorithms, a model based on quantum geometry could better represent natural language semantics. Semantic relationships seem not commutative [3]; they violates Leibniz's law as it happens in quantum logic; many semantic relationships are not represented by morphosyntactic elements, as the vector state is not observable; the stabilisation of a semantic bind could be modelled by entanglement. We will show how the Bell states can be used to encode the basic fundamental semantic relationships represented by Greimas’s semiotic square, thus providing a clue to develop new algorithms designed for information retrieval.
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence α is identified with a quantum information quantity, represented by a density operator of a Hilbert space, whose dimension depends on the logical complexity of α. At the same time, the logical connectives of the language are interpreted as operations defined in terms of quantum logical gates. Standard quantum computational models can be described as special cases of Fock space models, where the meaning of any sentence is localized in a precise sector of a Fock space ℱ. From an intuitive point of view, the increasing number of particles described in the different sectors of ℱ can be interpreted as increasing information.
The fundamental question that this thesis tries to contribute to is thus: is it possible to code and compute the meaning of phrases, such as "fluffy dog", in a way that encodes not only logical reasoning, but provides a way to return our (possibly multiple) common understanding(s) of such a phrase? We rely on a compositional approach: the grammar rules act as the "computational rules", and the meanings of the individual words compose with each other following those same rules, in a way that is consistent with the type of meaning that we wish to assign to each word. To use the grammar rules in this way, we rely on Lambek types. In this framework, a common noun is represented by a Lambek type n and an adjective is represented by a type n/n. Following the appropriate type composition rules, we can show that these two types can be mapped to the type n. This means that an adjective applied on a noun gives something that can be used in the same place on a sentence. This is very intuitive: "fluffy dog" could always be used in the place of "dog". The meanings must compose in a way that is homomorphic to the grammar composition. Additionally, it is convenient that these individual meanings have a format that a computer can understand. The choice made here comes from an approach to NLP called "distributional" semantics, that is able to extract vector representations of words by looking at the other words that usually appear next to it: "You shall know a word by the company it keeps". Each Lambek type is assigned a vector space, and so the composition takes place using operations in vector spaces. Then, each word of a certain type is assigned an element of the correct vector space, a vector. The vector space associated with the Lambek type n is N, which means that a word like "dog" is represented by a vector in the noun space. In its turn, the vector space associated with the Lambek type n/n is N⊗N, which describe maps between vectors. The elements of this space can be represented as matrices, and so an adjective such as "fluffy" is also represented by a matrix. The composition of the adjective and the noun, thus, is automatically computed by a computer as the application of the respective matrix to the respective vector, which in turn results in a vector in the space N, consistent with the resulting Lambek type n of grammar composition. This framework can be extend to more complex types and grammar formulations, which can get rather computationally heavy. One possibility to make these calculations more computationally efficient is to resort to quantum computation, by having each vector component as a quantum state and by performing the contractions using a quantum circuit. In this thesis we explore those avenues, with special focus on ambiguities that appear due to different possible readings of the same phrase, as is the case of the scope in "old men and women", or relative clauses in Dutch, where "man die de hond bijt" can translate either to "man that bites the dog" or "man that the dog bites". For these, the different possible contractions represent different readings, and they can exist simultaneously in quantum superposition. In the process, we explore ways of improving cosine similarity calculations using a metric tensor, and we develop a quantum computation algorithm that is capable to speed up the process of finding an answer to an open multiple choice question.
Tests are essential in Information Retrieval and Data Mining in order to evaluate the effectiveness of a query. An automatic measure tool intended to exhibit the meaning of words in context has been developed and linked with Quantum Theory, particularly entanglement. "Quantum like" experiments were undertaken on semantic space based on the Hyperspace Analogue Language (HAL) method. A quantum HAL model was implemented using state vectors issued from the HAL matrix and query observables, testing a wide range of windows sizes. The Bell parameter S, associating measures on two words in a document, was derived showing peaks for specific window sizes. The peaks show maximum quantum violation of the Bell inequalities and are document dependent. This new correlation measure inspired by Quantum Theory could be promising for measuring query relevance.
Abstract The possibilities of generating a contextual query using the quantum Hyperspace Analogue to Language (HAL) model are analyzed. An approach to establishing a semantic connection between words in texts is developed using the generally accepted basic formula for Bell’s parameter as a parameter of connection. A modification of the approach that allows determination of hyponymic isotopy and thus establish a semantic connection between the concepts is proposed. Prospects for using the quantum states of light to implement this approach are discussed.