Topic
Substring index
About: Substring index is a research topic. Over the lifetime, 123 publications have been published within this topic receiving 3027 citations.
Papers published on a yearly basis
Papers
Patent•
18 Mar 1994TL;DR: In this article, a method and apparatus for processing natural language and deducing meaning from a natural language input characterized by the steps of (a) receiving an ordered string of word objects having natural language meaning, (b) selecting a word window length, and (c) successively moving the word window along the ordered string and analyzing the meaning of a substring of a word objects that fall within the window.
Abstract: A method and apparatus for processing natural language and deducing meaning from a natural language input characterized by the steps of (a) receiving an ordered string of word objects having a natural language meaning, (b) selecting a word window length, and (c) successively moving the word window along the ordered string and analyzing the meaning of a substring of word objects that fall within the word window. The substring is removed from the ordered string if the substring has a recognized meaning, until all substrings of the ordered string that fit within the window have been analyzed. In a step (d), the word window length is reduced and step (c) is repeated until only an unrecognized residual of the ordered string remains. The meaning of the substring is analyzed by mapping the substring against a database using one or more mapping routines. The mapping routines are preferably arranged in a hierarchy, wherein a successive mapping routine is used to analyze the substring when a previous mapping routine in the hierarchy cannot map the substring. A computer-implemented task is determined from the recognized substrings and performed by the computer system. The apparatus of the present invention implements the method on a pen-based computer system, and the ordered string is preferably received from strokes entered by a stylus on a display screen of the pen-based computer or from a microphone receiving speech input.
265 citations
TL;DR: In this article, the authors consider pattern matching without decompression in the UNIX Z-compression scheme and show how to modify their algorithms to achieve a trade-off between the amount of extra space used and the algorithm's time complexity.
230 citations
Patent•
28 May 2015TL;DR: In this paper, the authors describe a system for handling multi-part voice commands for a virtual assistant that includes multiple actionable commands within a single utterance using a speech transcription process, where the text string can be parsed into multiple candidate substrings based on domain keywords, imperative verbs, predetermined substring lengths, or the like.
Abstract: Systems and processes are disclosed for handling a multi-part voice command for a virtual assistant. Speech input can be received from a user that includes multiple actionable commands within a single utterance. A text string can be generated from the speech input using a speech transcription process. The text string can be parsed into multiple candidate substrings based on domain keywords, imperative verbs, predetermined substring lengths, or the like. For each candidate substring, a probability can be determined indicating whether the candidate substring corresponds to an actionable command. Such probabilities can be determined based on semantic coherence, similarity to user request templates, querying services to determine manageability, or the like. If the probabilities exceed a threshold, the user intent of each substring can be determined, processes associated with the user intents can be executed, and an acknowledgment can be provided to the user.
225 citations
Patent•
8 May 2006
TL;DR: In this article, improved capabilities are described for mobile search substring query entry completion, wherein complete search terms are presented to a user in response to a search query that is not a fully formed query.
Abstract: In embodiments of the present invention improved capabilities are described for mobile search substring query entry completion, wherein complete search terms are presented to a user in response to a search query that is not a fully formed query.
161 citations
Patent•
31 Jul 1998
TL;DR: In this article, a method and apparatus for comparing an input or query file to a set of files to detect similarities and formatting the output comparison data are described, and a query file substring is selected and used to search a storage area containing multiple ordered file substrings that were taken from previously analyzed files.
Abstract: A method and apparatus are disclosed for comparing an input or query file to a set of files to detect similarities and formatting the output comparison data are described. An input query file that can be segmented into multiple query file substrings is received. A query file substring is selected and used to search a storage area containing multiple ordered file substrings that were taken from previously analyzed files. If the selected query file substring matches any of the multiple ordered file substrings, match data relating to the match between the selected query file substring and the matching ordered file substring is stored in a temporary file. The matching ordered file substring and another ordered file substring are joined if the matching ordered file substring and the second ordered file substring are in a particular sequence and if the selected query file substring and a second query file substring are in the same particular sequence. If the matching ordered file substring and the second query file substring match, a coalesced matching ordered substring and a coalesced query file substring are formed that can be used to format output comparison data.
151 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2020 | 1 |
| 2017 | 2 |
| 2016 | 8 |
| 2015 | 6 |
| 2014 | 8 |
| 2013 | 9 |