Generating unique document identifiers from content within a selected page region is disclosed. A selection of a first region within a first page of the documents is received from a user, and is defined by a set of first boundaries relative to the first page. A text string of a first base selection page content within the first region is retrieved from the first page. Then the retrieved text string is assigned to a page location index associated with the first page. A text string of a first replicated selection page content is retrieved from a second page. The first replicated selection page content is included in the same first region defined by the set of first boundaries relative to the second page. The retrieved text string of the first replicated selection page content is assigned to a page location index of the second page.

System and method for constructing a hierarchical index table usable for matching a search sequence to reference data. The index table may be constructed to contain entries associated with an exhaustive list of all subsequences of a given length, wherein each entry contains the number and locations of matches of each subsequence in the reference data. The hierarchical index table may be constructed in an iterative manner, wherein entries for each lengthened subsequence are selectively and iteratively constructed based on the number of matches being greater than each of a set of respective thresholds. The hierarchical index table may be used to search for matches between a search sequence and reference data, and to perform misfit identification and characterization upon each respective candidate match.

A repository of graph based visual programming language code instances is analyzed. A similar code portion pattern duplicated is detected among a group of graph based visual programming language code instances included in the repository of graph based visual programming language code instances including by using an index and tokenizing one or more graph nodes connected by one or more graph edges included in a flow corresponding to at least one graph based visual programming language code instance in the group of graph based visual programming language code instances. Within a visual representation of at least one of the group of graph based visual programming language code instances, elements belonging to the detected similar code portion pattern are visually indicated.

The present application discloses a method and an apparatus for information query, and an electronic device, which relates to a field of deep learning (DL), natural language processing (NLP) and artificial intelligence (AI) technology. The method includes: receiving a query sentence, segmenting the query sentence to obtain word segments, and obtaining a dependency relationship between two word segments and part of speech of the word segments; obtaining a coding sequence of the query sentence according to the dependency relationship and the part of speech of the word segments; matching the coding sequence with a generalized template to obtain a core corpus of the query sentence, wherein the generalized template comprises part of speech to be extracted and a dependency relationship to be extracted; and obtaining a query result corresponding to the query sentence based on the core corpus. The application no longer relies on the accumulation of massive business scenario data to enhance a generalization ability, which ensures accurate and efficient information query, and improves the efficiency and reliability of the information query process. At the same time, it may support information query in different business scenarios, with strong expansion capability and high universality.

A method for outputting a search result includes: executing a reception process that includes receiving a search query for target data; executing a candidate item identification process that includes referring to index information associating each of a plurality of items included in the target data with a position of a corresponding one of the items, and identifying a first storage area configured to store an item corresponding to a keyword included in the search query; and executing an addition process that includes when a description included in the corresponding one of the items includes a reference to a different item, referring to the index information, and adding information on a second storage area configured to store the different item to the reference to the different item.

The present disclosure provides systems and methods that include or otherwise leverage use of a multiscale quantization model that is configured to provide a quantized dataset. In particular, the multiscale quantization model can receive and perform vector quantization of a first dataset. The multiscale quantization model can generate a residual dataset based at least in part on a result of the vector quantization. The multiscale quantization model can apply a rotation matrix to the residual dataset to generate a rotated residual dataset that includes a plurality of rotated residuals. The multiscale quantization model can perform reparameterization of each rotated residual in the rotated residual dataset into a direction component and a scale component. The multiscale quantization model can perform product quantization of the direction components of the plurality of rotated residuals, and perform scalar quantization of the scale components of the plurality of rotated residuals.

Provided are an electronic device for sorting homomorphic ciphertext by using shell sorting and an operating method thereof to sort ciphertext generated by using homomorphic encryption according to a size of an original number corresponding thereto.

Various embodiments are provided for implementing an approximation nearest neighbour (ANN) search in a computing environment are provided. An approximation nearest neighbour (ANN) of a plurality of feature vectors in hyper-planes with dynamically variable subspaces by searching an inverted index may be retrieved.

A method, system and computer-usable medium are disclosed for improving search engine ranking of a landing page using automated analysis of landing pages of third-party entities. Certain embodiments include receiving, at a user interface, a primary keyword associated with a targeted landing page of a primary entity; transmitting the primary keyword to a search engine; and receiving a search engine results page from the search engine. The search engine results page may be used to identify landing pages of third-party entities having a higher rank than the targeted landing page. Secondary keywords occurring on the third-party landing pages may be identified and analyzed to determine whether inclusion of the secondary keyword in the targeted landing page will increase ranking of the targeted landing page in the search engine.

A method for providing search capabilities across platforms to identify information from related accounts is disclosed. The method includes receiving, via an application programming interface, a request from a user interface, the request including a search string and a user profile; identifying an account identifier based on the user profile; associating the identified account identifier with the request; retrieving, from a networked repository, an indexed field based on the request and the associated account identifier; configuring the retrieved indexed field for presentation via the user interface; and presenting, via the user interface, the configured indexed field in response to the request.