Abstract:
A computer-implemented method for dynamically presenting a prewritten text in a graphical user interface is disclosed. The method comprises receiving a text artifact, storing the text artifact in a memory device of a computer, retrieving the text artifact, displaying the text artifact on the display screen of the computer, receiving a vocal input, generating a text file representing the words spoken in the vocal input, comparing a predetermined number of the hypothesis words to a predetermined number of the artifact words, determining a match location in the text artifact where a specific number of the predetermined number of hypothesis words match a specific number of the predetermined number of artifact words, and altering the display on the display screen to display the match location on the display screen of the computer.

Description:
PRIORITY 
       [0001]    This application claims benefit to U.S. Provisional Patent Ser. No. 62/044,506 filed on Sep. 2, 2014. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The invention relates generally to speech recognition software and techniques and more specifically to a system and method for providing a dynamic teleprompter application for automatically scrolling the text of a speech given by a user based on speech recognition. 
       BACKGROUND OF INVENTION 
       [0003]    Teleprompters are known in the art. Those speaking publicly may utilize a teleprompter to read from when giving a speech. The teleprompter displays the words of the script from which the reader is to read aloud. Teleprompters normally scroll through the script manually as chosen by a speaker. When a teleprompter is set at a constant rate the reader may fall behind the script and get lost or may read faster than the script and have to wait for the script to catch up. When a speaker moves the script manually and the speaker goes off script for a period of time, the speaker may forget to progress the script when the speaker goes back on script. Additionally, if a speaker wishes to jump ahead and skip a certain section then it would be difficult to quickly jump ahead to the specific section manually. What is needed is a system and method by which a written script is tracked and presented to a reader by recognizing the words that are being spoken orally and presenting the section of the script being read or heard at that time. 
       SUMMARY OF THE INVENTION 
       [0004]    The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed innovation. This summary is not an extensive overview, and it is not intended to identify key/critical elements or to delineate the scope thereof. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later. 
         [0005]    The invention is directed toward a computer-implemented method for dynamically presenting a prewritten text in a graphical user interface. The method comprises receiving a text artifact, the text artifact containing a plurality of artifact words, storing, via a processor, the text artifact in a memory device of a computer, retrieving, via the processor, the text artifact, displaying the text artifact on the display screen of the computer, receiving a vocal input, generating, via the processor, a text file representing the words spoken in the vocal input, the text file containing a plurality of hypothesis words, comparing, via the processor, a predetermined number of the hypothesis words to a predetermined number of the artifact words, determining a match location in the text artifact where a specific number of the predetermined number of hypothesis words match a specific number of the predetermined number of artifact words, and altering, via the processor, the display on the display screen to display the match location on the display screen of the computer. The method may further comprise highlighting on the display of the computer screen one or more artifact words within the match location of the text artifact. 
         [0006]    The method of highlighting may comprise altering the font of one or more artifact words on the display screen, altering the color of the font of one or more artifact words on the display screen, or creating a rectangular box surrounding one or more artifact words on the display screen of the computer. 
         [0007]    The method may further comprise determining whether one or more words of the plurality of hypothesis words have been matched to a match location of the text artifact and removing one or more words from the plurality of hypothesis words, wherein the removed words have been previously matched to a match location of the text artifact. The method may further comprise determining whether the plurality of hypothesis words number four or more. 
         [0008]    The method may further comprise retrieving twenty words of the text artifact following the match location and comparing, via the processor, a predetermined number of the hypothesis words to the twenty words of the text artifact following the match location. 
         [0009]    The method may further comprise determining, via the processor, the font size of the text of the text artifact as displayed on the display screen, determining, via the processor, the orientation of the electronic screen displaying the text of the text artifact, and altering, via the processor, the predetermined number of artifact words utilized for comparing to the predetermined number of hypothesis words. 
         [0010]    In one embodiment of the invention the step of comparing the predetermined number of the hypothesis words to the predetermined number of the artifact words comprises creating a first group containing the predetermined number of hypothesis words, creating a second group containing the predetermined number of artifact words, the second group being displayed on the display screen of the computer, respectively determining whether each of the predetermined number of hypothesis words is present in the first group, respectively determining whether each of the predetermined number of artifact words is present in the first group, and generating a single number, wherein the single number is representative of the degree of similarity between the first group and the second group. 
         [0011]    In another embodiment of the invention the method may further comprise determining two or more second groups of the predetermined number of artifact words having a generated single number greater than a predetermined number, creating a list of all bigrams contained in the predetermined number of hypothesis words, creating a list of all trigrams contained in the predetermined number of hypothesis words, respectively creating a list of all bigrams contained in each of the two or more second groups, respectively creating a list of all trigrams contained in each of the two or more second groups, respectively comparing each list of bigrams of the two or more second groups to the list of all bigrams contained in the predetermined number of hypothesis words, respectively comparing each list of trigrams of the two or more second groups to the list of all trigrams contained in the predetermined number of hypothesis words, determining one of the two or more second groups of the predetermined number of artifact words having the greatest total number of bigrams and trigrams present in the list of all bigrams and the list of all trigrams contained in the predetermined number of hypothesis words, selecting the one of the two or more second groups of the predetermined number of artifact words having the greatest total number of bigrams and trigrams present in the list of all bigrams and the list of all trigrams contained in the predetermined number of hypothesis words, and selecting a portion of the text artifact, wherein the selected portion of text artifact contains the selected one of the two or more second groups of the predetermined number of artifact words having the greatest total number of bigrams and trigrams present in the list of all bigrams and the list of all trigrams contained in the predetermined number of hypothesis words. 
         [0012]    In another embodiment of the invention the method may further comprise establishing a scroll rate for the text artifact on the display screen of the computer. The method may further comprise increasing the scroll rate when a speaker&#39;s location in the text artifact is ahead of the highlighting. The method may further comprise decreasing the scroll rate when a speaker&#39;s location in the text artifact is behind the highlighting. 
         [0013]    Still other embodiments of the present invention will become readily apparent to those skilled in this art from the following description wherein there is shown and described the embodiments of this invention, simply by way of illustration of the best modes suited to carry out the invention. As it will be realized, the invention is capable of other different embodiments and its several details are capable of modifications in various obvious aspects all without departing from the scope of the invention. Accordingly, the drawing and descriptions will be regarded as illustrative in nature and not as restrictive. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0014]    Various exemplary embodiments of this invention will be described in detail, wherein like reference numerals refer to identical or similar components, with reference to the following figures, wherein: 
           [0015]      FIG. 1  is a view of the system of the invention; 
           [0016]      FIG. 2  is a view of the system of the invention; 
           [0017]      FIG. 3  is a view of a text artifact; 
           [0018]      FIG. 4A  is a view of a device utilizing the invention; 
           [0019]      FIG. 4B  is a view of a device utilizing the invention; 
           [0020]      FIG. 5  is a schematic displaying the method of the invention; 
           [0021]      FIG. 6  is a schematic displaying the method of the invention; 
           [0022]      FIG. 7  is a schematic displaying the method of the invention; 
           [0023]      FIG. 8  is a schematic displaying the method of the invention; 
           [0024]      FIG. 9  is a schematic displaying the method of the invention; and 
           [0025]      FIG. 10  is a view of a device utilizing the invention. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0026]    The claimed subject matter is now described with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the claimed subject matter. It may be evident, however, that the claimed subject matter may be practiced with or without any combination of these specific details, without departing from the spirit and scope of this invention and the claims. 
         [0027]    As used in this application, the terms “component”, “module”, “system”, “interface”, or the like are generally intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a controller and the controller can be a component. 
         [0028]    The invention pertains to a method and system utilizing speech recognition to locate a specific location in a prewritten script (also known as a text artifact). The method may further provide for graphically presenting a section of the prewritten script to a user. The graphical representation of the prewritten script may display any amount of the prewritten script. In the preferred embodiment, the graphical presentation of the prewritten script displays the section where the speech recognition locates the speaker as reading from. The speaker&#39;s place may be highlighted or otherwise shown in a distinctive manner. In the preferred embodiment a small section of the prewritten script before this location is displayed and a small portion of the prewritten script after this section is displayed. These three portions may be of any size and display any number of words. In this method a computer system and program is utilized to receive an auditory input of spoken words. The computer system then creates a number of hypotheses about the words being spoken. The computer system cross references the hypotheses of the spoken words with the prewritten script. The computer system then locates the specific section of the prewritten script from where the words are being spoken. The system and method may be used for any purpose, on any computerized device, including but not limited to a desktop computer, a laptop computer, a tablet computer, a wireless cellular phone, or any other computerized device. The specific manner utilized to perform the method of the invention may be any number of ways. There may be variations in the specific mechanisms utilized without varying from the scope of the invention. 
         [0029]    The software utilized for performing the invention may have a multitude of additional features. The system and method of the invention may be practiced with or without the additional features. The software may allow for a user to create an audio recording of any speech as it is given. The system stores the audio file of the recording in a file which may be associated with the prewritten script. The software may allow for a user to turn off the automatic scrolling function so that the user can scroll manually through the prewritten script. Alternatively, the user may set the prewritten script to advance at a set rate. The set rate may be any number of words per minute as desired by the user. The software may utilize a clock or timer. The timer can display the total time that the speaker has been speaking for. Alternatively, the user can input a set time as a time limit for the speech. The timer will then count down, displaying the time left, and will alert the user when the remaining time has run out and the user is out of speaking time. The system may allow a user to type a prewritten script directly into the software application and store for later utilization. Alternatively, the user may type a prewritten script in a separate software application and then utilize the file created in the software. The user may customize the settings of the software, such as standard font size and microphone sensitivity levels. The system may permit the user to create a password protected user ID to utilize the software. The system may permit the user to only view the prewritten scripts associated with that user&#39;s user ID. Multiple users may utilize the software system on a single device by each having a unique user ID. The system may permit users to share prewritten scripts with other users. The system may permit a user to friend other users of the system. The system may store prewritten scripts on a third party server and permit a user to store and retrieve prewritten scripts remotely through an internet connection. The software may contain a search function. The search function may permit a user to search through titles of prewritten scripts. The search function may permit a user to search through the content of multiple prewritten scripts to find prewritten scripts containing specific keywords and choose one for presentation. The search function may permit a user to search for a keyword or phrase within a prewritten script during the reading of the prewritten script. This function would permit the user to search and find a specific section of the prewritten script so the user may start reading from that section. 
         [0030]    Although the specific manner of performing the method may be performed through a number of separate embodiments, only the preferred embodiment will be described in detail. In the preferred embodiment, a speech recognition algorithm recognizes the words being spoken by a user and creates a series of hypotheses of the words being spoken. A matching algorithm matches the hypothesis generated to a prewritten script. The matching algorithm may make a match with any number of words or phonemes received. In the preferred embodiment, a minimum of three words is needed to match against the prewritten script. The matching algorithm may attempt to match the hypothesis received against any number of words or part of the prewritten script. In the preferred embodiment the algorithm attempts to match the hypothesis against the next twenty words in the prewritten script appearing after the last positive match. The match may be made with or without reference to the order of the words in the prewritten script. Thus if all words in a hypothesis are present in a portion of the prewritten script (even if not in the same order) then a positive match may be made. The matching algorithm may or may not authenticate the matched location. The algorithm may authenticate a positive match by verifying that the order of the words in the matched portion of the prewritten script is identical to the order of words in the hypothesis. 
         [0031]    Referring to  FIG. 1  and  FIG. 2 , the invention is performed on a computerized device  10  with a display screen  15 . The display screen  15  displays the text artifact  100 . In the preferred embodiment the display screen  15  is integral to the body of the computerized device  10 . In other embodiments the display screen  15  is separate from the computerized device  10 . The computerized device  10  receives the vocal input of the user through a microphone. The microphone may be integral to the body of the computerized device  10  or separate from the computerized device  10 . The display screen  15  displays the text artifact  100  in accordance with the instructions from the computerized device  10 . As shown in  FIG. 1 , the computerized device  10  may be a laptop style computer or, as shown in  FIG. 2 , the computerized device  10  may be a tablet style computer or smartphone. 
         [0032]    At the heart of the matching algorithm is the ability for the app to take a hypothesis fed to it by the speech recognition algorithm and match it to the right piece of text within the script that corresponds to the user&#39;s current location in the script. As shown in  FIG. 3 , the text artifact  100  contains a plurality of lines of text  110 . The matching algorithm determines the specific line of text  110  which the vocal input matches and adjusts the text artifact  100  on the display  15  of the computerized device  10 . As shown in  FIG. 4A  and  FIG. 4B , the computerized device  10  receives the vocal input of the speaker, matches the vocal input to a specific line of text  110 , and highlights the location of the specific line of text  110  on the display screen  15 . As shown in  FIGS. 4A and 4B , the highlight  112  distinctly points out to the user the section from which the user is reading. As shown in  FIG. 4A , the highlight  112  is a colored box surrounding the specific line of text  110  of the text artifact  100  that the speaker is reading from. As the speaker progresses through the text artifact  100  the highlighting  112  progresses with the speaker. As shown in  FIG. 4B , the highlighting  112  moves lower down the text artifact  100  on the display  15  of the computerized device  10 . 
         [0033]    The algorithm which is used to achieve this must also adhere to the following requirements:
       Accurately match the last spoken hypothesis to the closest match to it in the text from the user&#39;s current location.   Discard any speech made by the user which does not correspond to any part of the text.   Avoid skipping forward in the document that might result of incorrectly matching the current hypothesis to the wrong text in the Script.       
 
         [0037]    In the preferred embodiment, the matching algorithm relies on input generated by the speech recognition algorithm. As a user speaks, the speech recognition algorithm generates and passes hypotheses of the words it has detected to be spoken to the matching algorithm. As hypotheses are generated by the speech recognition algorithm, the matching algorithm attempts to match these to the words within the text being presented. The matching algorithm keeps track of the current line of text that the presenter is detected to be on and attempts to match the hypotheses generated by the speech recognition algorithm to the next 20 words of text from the line that the user is detected to be on. 
         [0038]    For every hypothesis generated the matching algorithm performs the following processing steps:
       Hypothesis Refinement   Cosine Distance Match   N-Gram Analysis Match       
 
         [0042]    These processing steps may be performed independently from each other and not all steps must be performed. For instance, the algorithm may forego the hypothesis refinement or may forego the N-Gram analysis. The N-Gram analysis may only be performed if necessary. 
         [0043]    Referring to  FIG. 5 , the broad method of the invention is displayed. First the computerized device receives and stores a text artifact of the speech to be read by the user  200 . Then the computerized device receives the vocal input of the user  202 . The computerized device then generates a hypothesis of the words spoken  204 . The computerized device refines the hypothesis by removing words from the hypothesis which have been previously matched to the text artifact  206 . The computerized device compares the hypothesis to the words in the text artifact  208 . The computerized device then transitions the display of the text artifact to display the matched line of text and could highlight the matched line of text  210 . 
         [0044]    Referring to  FIG. 6 , the detailed embodiment of the method is displayed. First the computerized device derives a scoped hypothesis by subtracting the last matched hypothesis from the new hypothesis  300 . The system then determines whether the scoped hypothesis contains at least four words  302 . If the hypothesis does not contain at last four words then the system continues to receive vocal input until the scoped hypothesis contains at least four words. The system then extracts from the text artifact the next set of words which will be used to compare to the scoped hypothesis  304 . The system performs a cosine distance matching function  306  and generates a number corresponding to the level of match between a specific section of the text artifact and the hypothesis. In the preferred embodiment, the system requires a minimum output number from the cosine distance matching function to determine a match from the hypothesis and a section of the text artifact. The system then determines whether there is a single possible match in the text artifact which has the minimum output number  308 . If the system determines that there is a single section of text artifact with a match greater than the minimum required value then the system concludes that there is a match to that specific section of text in the text artifact  310 . If there are multiple sections of text which have a score over the minimum level then the system performs an n-gram analysis on the highest three possible matches  312 . The system then selects the section of the text artifact with the highest n-gram score and concludes that there is a match with the text artifact  314 . 
         [0045]    In the preferred embodiment of the hypothesis refinement, the following process is followed. A speech recognition algorithm generates hypotheses which are not mutually exclusive of each other. That is as a user speaks a sentence, the speech recognition algorithm may generate X hypotheses with each hypothesis being composed up of all words in the previous hypothesis appended with a single new word. The speech recognition algorithm may continue to generate hypotheses by appending newly detected words on an ongoing sentence or may reset and generate a hypothesis with just the last word it has detected. 
         [0046]    The first step of the matching algorithm is to refine the hypothesis and pull out only those words which are new or which haven&#39;t been matched as part of the last hypothesis that was attempted to be matched by the matching algorithm. This scoped down hypothesis becomes the piece of text which is attempted to be matched against the next set of 20 words in the document. The algorithm will only attempt to match a scoped hypothesis which has at least 4 words, otherwise it skips processing of it and waits until a hypothesis can be created with at least 4 words. 
         [0047]    For example, for the following text: “Turning once again, and this time more generally, to the question of invasion”, the following hypotheses may be generated by a speech recognition algorithm as a user reads the text:
       1. Turning   2. Turning once   3. Turning one   4. Turning once again   5. Turning once again an   6. Turning once again and this   7. Turning once again and this time   8. Turning once again and this time more generically   9. Turning once again and this time more generally to the   10. Turning once again and this time more generally to the question       
 
         [0058]    In the preferred embodiment of the cosine distance matching, the following process is followed. Once a scoped down hypothesis has been generated by the matching algorithm the next step in the match algorithm is to look at the next X words of text in the document and attempt to determine a measurement of the similarity between the generated text and the text within the document. The value of X is variable and may be defined in any manner. In the preferred embodiment the value of X is defined based on the font size used and the device screen size. 
         [0059]    The first part of the match algorithm uses a Cosine Distance Matching algorithm to break down the scoped hypothesis and the next 20 words of text in the document to measure the number of words between the two that match. 
         [0060]    The pseudo code for the Cosine Distance algorithm resembles this: 
         [0000]    Given an array H that contains the scoped hypothesis of length k words.
 
Given a vector V which contains each unique word in H and the number of times it appears in H.
 
Given an array T that contains the next X words of the text document.
 
1.) Retrieve the next k words of text from T, Tw.
 
2.) Create a vector Vw which is the same length as V.
 
3.) For every unique word in Tw which is also found in V, set the value in Vw at the same index to 1.
 
4.) Perform a dot-product calculation on Vw against V. If the dot product is greater than 0, then store the result for that window of text as Rw.
 
5.) Go to 1 and repeat until no more words in T to process.
 
         [0061]    At the end of this process, the algorithm has a list of all dot products (Rw) for each window of text from T that was analyzed. If the algorithm ends with more than 3 windows of text that have a non-zero dot product, the algorithm then uses N-Gram analysis to further analyze and identify the best match in the text. 
         [0062]    If the algorithm ends with only 1 window of text that produces a non-zero dot product, then that window of text is determined to be the best match for the hypothesis H. If the algorithm outputs no windows of text with a non-zero dot product, then the hypothesis is not matched against any part of the text and processing stops until the next hypothesis is received. 
         [0063]    This process is illustrated in  FIG. 7 . First the system retrieves the section of text artifact following the prior matched hypothesis  400 . The system then creates a vector containing each unique word in the hypothesis and the number of times it appears in the hypothesis  402 . The system then creates one or more vectors from the section of text artifact, with each vector having the same length as the hypothesis vector  404 . The system then performs a dot-product calculation for each vector from the text artifact with the vector from the hypothesis  406 . The system then selects the section of text from the text artifact having the highest dot-product calculation result  408 . The system then scrolls the text artifact on the display screen of the device to prominently display the selected section of text from the text artifact  410 . The system then may highlight the selected section of text from the artifact on the display screen of the device  412 . 
         [0064]    The following is an illustration of the cosine distance matching function performed by the system. The cosine distance matching function is represented by the following algorithm: 
         [0000]    
       
         
           
             
               A 
               · 
               B 
             
             = 
             
               
                 
                   ∑ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                   
                     A 
                     i 
                   
                    
                   
                     B 
                     i 
                   
                 
               
               = 
               
                 
                   
                     A 
                     1 
                   
                    
                   
                     B 
                     1 
                   
                 
                 - 
                 
                   
                     A 
                     2 
                   
                    
                   
                     B 
                     2 
                   
                 
                 + 
                 … 
                 + 
                 
                   
                     A 
                     n 
                   
                    
                   
                     B 
                     n 
                   
                 
               
             
           
         
       
     
         [0000]    As represented in the function the hypothesis would be represented by A and the text artifact would be represented by B. The first word of the hypothesis would be represented by A 1 , the second word of the hypothesis would be represented by A 2 , and so on. The first word of the text artifact would be represented by B 1 , the second word of the text artifact would be represented by B 2 , and so on. 
         [0065]    The number for each spot in the vector for the hypothesis is a 1 because the word is present in the text artifact. The words in the section of text artifact are then compared to the hypothesis. If the word in the text artifact is present in the hypothesis then the spot for that word is represented by a  1  in the vector. If the word is not present in the hypothesis then the spot for that word is represented by a zero. The dot product function then gives a number for that specific section of the text artifact. The higher the number as a result the more likely that specific section of text artifact is a match to the hypothesis. 
         [0066]    As an illustration of the cosine distance matching function, and by no means limiting the scope of the invention, assume that the hypothesis of the vocal input is “The big dog bit the small dog.” In this illustration the next section of text artifact to be matched is “The dog was bit on his leg.” The system creates a vector of the hypothesis where V=(the, big, dog, bit, the, small, dog). Since each of these words are in the hypothesis then the numerical representation of the vector is V=(1, 1, 1, 1, 1, 1, 1). The system creates a vector for the next section of text artifact where Vw=(the, dog, was, bit, on, his, leg). Represented numerically Vw=(1, 1, 0, 1, 0, 0, 0). If a word in a specific spot is present in the hypothesis then it is represented by a 1. If it is not present then it is represented by a 0. The system performs a dot product of V and Vw. In this instance, V·Vw=(1×1+1×1+1×0+1×1+1×0+1×0+1×0)=1+1+0+1+0+0+0=3. In this instance, the next section of text results in a dot product result of 3. If the next words in the text artifact are “The big dog bit the small dog” then the system performs a dot product in the same manner. The result of the dot product for this section of the text artifact is 7. Because 7 is greater than 3 the system determines a match at the section of text artifact reading “The big dog bit the small dog.” The system then scrolls the display of the text artifact to display “The big dog bit the small dog” and further highlights the section of the text artifact containing the words “The big dog bit the small dog.” 
         [0067]    The Cosine Distance algorithm while giving a measure in the similarity of the two pieces of text contains no provision for the order of the words. Hence if there are 3 or more non-zero dot products, the algorithm performs N-Gram Analysis which does take into account the order of words to identify which window of text is the best match for the hypothesis. 
         [0068]    In the preferred embodiment of the N-Gram analysis, the following process is followed. The N-Gram analysis takes as an input the top 3 candidate matches from the document outputted by the Cosine Distance formula and then analyzes them to identify which one of them best matches the scoped hypothesis taking into account the order of the words. The N-Gram analysis performs an analysis of the candidate matches and generates a score indicating the strength of the match that does take into account the order of the words. An example of how N-Gram analysis is performed is as follows: 
         [0069]    Given a hypothesis H, 
         [0070]    A list of all bigrams in H: Bh 
         [0071]    A list of all trigrams in H: Th 
         [0072]    For each window of text Tw: 
         [0073]    1.) Extract all the bigrams of Tw into Bw. 
         [0074]    2.) Extract all the trigrams of Tw into Triw. 
         [0075]    3.) Count the number of elements in Bw which match Bh. 
         [0076]    4.) Count the number of elements in Triw which match Th. 
         [0077]    5.) Add the output of 3.) and 4.) and assign that as the N-gram score for Tw. 
         [0078]    Once all the N-gram scores have been calculated, the algorithm chooses the window of text (Tw) which has the highest N-gram score to be the best match to the scoped hypothesis. 
         [0079]    To improve the accuracy of the N-Gram score and to reduce the instances of false positives being matched (i.e. when the user goes off script, the algorithm needs to be smart enough to not generate any matches against the text), the N-Gram analysis filters and ignores any bigrams or trigrams that match any 1 of the 70 of the most common articles found in the English language. Any N-gram which is generated that matches one of the articles in this list of 70 is ignored by the analysis and does not contribute to the final scoring. 
         [0080]    The N-gram analysis process is illustrated in  FIG. 8 . The system first determines that there are multiple sections of the text artifact as possible matches to the hypothesis  500 . The system then generates a list of all bigrams in the hypothesis  502 . The system then generates a list of all trigrams in the hypothesis  504 . The system generates a list of all bigrams in each respective section of text artifact  506 . The system then generates a list of all trigrams in each respective section of text artifact  508 . The system then compares the bigrams and trigrams of the hypothesis to the bigrams and trigrams of each respective section of the text artifact  510 . The system then determines the section of text artifact with the highest number of bigram and trigram matches to the hypothesis  512 . In this process the order of the words are taken into account. The bigrams are composed of two phonemes, two syllables, or two words which are presented in side by side in direct progression. The trigrams are composed of three phonemes, three syllables, or three words which are presented in direct order. 
         [0081]    In the preferred embodiment at the end of the Cosine Distance and N-Gram analysis, the matching algorithm takes the window of text Tw that is determined to be the best match against the hypothesis and identifies the line number in the document that that window corresponds to. Once the algorithm has detected that it is on a particular line of text in the document then the next time a hypothesis is analyzed it will only attempt to match against words of text taken from the next line. 
         [0082]    In one embodiment of the invention, the process is performed by a computer matching algorithm. A separate algorithm receives an auditory input of a speaker&#39;s voice and creates a series of hypotheses of the words being spoken. The matching algorithm receives an input of these series of hypotheses of the spoken words. The matching algorithm then performs the following steps— 
         [0083]    1.) Derive a scoped hypothesis which is the subtraction of the last matched hypothesis from the new hypothesis. 
         [0084]    2.) Does the scoped hypothesis have at least 4 words in it? If yes, continue to 3. If no, then stop processing and wait for the next hypothesis. 
         [0085]    3.) Extract from the artifact the next set of words which will be used to compare the scoped hypothesis against. 
         [0086]    4.) Perform Cosine Distance matching step 
         [0087]    5.) Did the Cosine Distance step produce a single possible match with a distance score of at least 3.0? If yes, then we conclude that the scoped hypothesis to be matched on the line of text that begins the possible match, we increment the current line marker and wait for the next hypothesis. If no and there are more than 1 possible matches, continue to 6.). If no and there are no possible matches with a score of at least 3.0, then stop processing and wait for the next hypothesis. 
         [0088]    6.) Take the top 3 possible matches from the Cosine Distance step and perform an N-Gram analysis. 
         [0089]    7.) Select the possible match which has the highest score in the N-Gram analysis and conclude that the scoped hypothesis to be matched on the line of text that the possible match begins on. Increment the current line marker and wait for the next hypothesis to process. 
         [0090]    In a separate component of the method and system, the invention provides for the ability to dynamically change the start location of the prewritten script. This component permits the user to pause and restart of the tracking of the reading of the prewritten script. The software tracks the location of the prewritten script from where the user is reading. The user may view the prewritten script on a computerized presentation device with a touch screen user interface. The user may move the location of the prewritten script by touching the touch screen user interface and dragging through the prewritten script to a different location. The user may scroll through the prewritten script manually in this manner. The user may scroll forward in the prewritten script to skip a certain section or may scroll backward in the prewritten script to review or repeat a prior section. In this component the speech recognition software automatically tracks the movement made by the user and resets to track the speech of the user from the location that the user moved to. The software tracks this move by the user automatically without the user needing to reset the starting or tracking point. 
         [0091]    In a specific example of the utilization of this component, and by no means limiting the scope of this component, a user may start at the first paragraph of a prewritten script. The system tracks the location of the speaker as the speaker reads from the first paragraph. If, when the speaker reaches the second paragraph, the speaker decides to skip the second paragraph and read from the third paragraph, the user can touch the screen and swipe the prewritten script forward to the third paragraph. The speaker then starts reading from the prewritten script at the third paragraph. The system starts tracking the location that the speaker is reading from and presenting the third paragraph of the prewritten script to the user. The software automatically starts tracking from this new location. 
         [0092]    In a separate component of the invention, the method and system provide for highlighting a specific word, region, or portion of the prewritten script that is matched by the speech recognition software. The highlighting method is performed in real time as the speaker reads from the prewritten script. The highlighting is performed by the software as a means of presenting to the speaker the portion of the prewritten script that the speaker is reading from so that the speaker may keep track of the speaker&#39;s location during reading from the prewritten script. In one specific example of one embodiment of this component, and in no way limiting the scope of this component, the method performed by this component matches the location of the prewritten script from which the speaker is reading. The software then presents the location of the prewritten script that the speaker is reading from in highlighted format. For instance, the highlighted section may be presented on a line by line basis. The line before the line from which the speaker is reading is presented in normal format. The line after the line from which the speaker is reading is presented in normal format. The line between the two, the line from which the speaker is reading, is presented in a highlighted format. As the reader progresses reading through the prewritten script the highlighted format progresses through the prewritten script along with the speaker. As the speaker reaches the next line the highlighted formatting moves to the next line as well. The prior line which was highlighted as the speaker read from it is no longer presented in a highlighted format once the speaker is no longer reading from that line of the prewritten script. In other embodiments of this component, the highlighted formatting may be presented on a word by word basis rather than line by line. In another embodiment, the highlighting formatting is set to present the words which the speaker has already read in a highlighted formatting so the speaker may know what words have already been read. In another embodiment, the highlighted formatting may be presented on a section by section basis. The section highlighted may be any number of words or any number of lines of the prewritten script. The highlighted formatting may be completed in any type of format, such as changing the color of the text, changing the color of the background of the text, changing the font of the text, changing the size of the font of the text, presenting the text in bold, presenting the text in italics, or presenting the text in another format that is distinctive from the format of the rest of the text of the prewritten script. 
         [0093]    In a separate component of the invention, the method and system provide for dynamically scrolling through the prewritten script of the speaker as the speaker is reading from the prewritten script. The scrolling method dynamically adjusts based on the speaker&#39;s actual position in the text. The method provides that the text scrolls smoothly from line to line as the speaker reads from the prewritten script. The pace of the scrolling adjusts dynamically to the position of the speaker as the speaker reads from the prewritten script that is displayed on the graphical user interface. If the speaker is towards the bottom of the portion of the prewritten script displayed on the display then the system speeds up the pace of the scrolling quickens to catch up to the position of the speaker. If the speaker reads from the top of the portion of the prewritten script displayed on the display then the system slows down the pace of scrolling to allow the speaker to catch up to the prewritten script displayed in the middle portion of the display screen. This component permits the system to track and present the prewritten script in the proper manner to follow the pace of the speaker. Thus, the speaker can speak at the pace chosen by the speaker and the system will follow dynamically. Further, the speaker may change pace throughout the presentation of the speech and the system will follow the changes in pace made by the speaker. 
         [0094]    The method of altering the scrolling of the text artifact is displayed in  FIG. 9 . First the system establishes a predetermined scroll rate for the text artifact to scroll on the device display screen  600 . The system then determines the position of the speaker in the text artifact by determining the location of the text artifact where the hypothesis has been matched and its location on the screen of the computerized device. The system is configured to continuously present the location of the speaker in the text artifact within the middle section of the display screen of the computerized device. The system then determines whether the central portion of the text artifact displayed on the screen of the computerized device is behind the position of the speaker (or the location of the hypothesis match in the text artifact)  602 . If the central displayed section is behind the position of the speaker then the system accelerates the scrolling  604 . The system then determines whether the central displayed section is far behind the speaker&#39;s position  606 . If the central displayed section is far behind the position of the speaker then the system accelerates the rate progressively and advances the text artifact  608 . If the central displayed section is not far behind the position of the speaker then the system accelerates the scrolling incrementally and advances the text artifact  610 . If the central displayed section is not behind the position of the speaker, but is instead ahead of the speaker&#39;s position then the system decelerates the scrolling  612 . The system then determines whether the central displayed section is far ahead of the speaker&#39;s position  614 . If the system determines that the central displayed section is not far ahead of the speaker&#39;s position then the system decelerates the scrolling incrementally and advances the text artifact  616 . If the system determines that the central displayed section is far ahead of the speaker&#39;s position then the system decelerates progressively and stops the scrolling of the text artifact  618 . 
         [0095]    Referring to  FIG. 10 , the scrolling method of the invention is further illustrated. The display screen  15  prominently displays the central displayed section  700  in the center of the display screen  15 . In the preferred embodiment the matched hypothesis is continuously located within the central display section  700 . If the system determines that the matched hypothesis is located in the top display section  710  then the system automatically increases the scrolling rate of the text artifact  100  on the display screen  15 . If the system determines that the matched hypothesis is located in the bottom display section  720  then the system automatically decreases or stops the scrolling rate of the text artifact  100  on the display screen  15 . 
         [0096]    In a separate component of the invention, the method and system automatically adjust the presentation of the prewritten script based on manual adjustments made by the user on the graphical display of the device. In this component, the user may touch and the graphical display of the device displaying the prewritten script. In one embodiment of this component, the user utilizes a computerized device with a touch screen display. The user can use two fingers to touch the touch screen display and pinch the screen to zoom out. The user can zoom in on the prewritten script by moving both fingers in opposite directions. When a user utilizes the zoom in and out feature the software automatically adjusts the text size of the prewritten script. In one example of an embodiment of this component, and by no means limiting the scope of this component, a user touches the touch screen display with two fingers and moves both fingers apart. This move enacts the zoom in feature. The font of the prewritten script would thus change and get larger. Alternatively, the user may touch the touch screen display with two fingers and pinch the two fingers together. This move enacts the zoom out feature. The font of the prewritten script would thus change and get smaller. The zoom feature may occur in a multitude of embodiments. For instance, when zooming out the display may show additional lines of the prewritten script that were not viewable on the display screen before zooming out. Alternatively, the display may still only show the original lines of the prewritten script without adding lines which were not viewable before zooming out. In another embodiment, the zoom feature may rearrange the number of words present on each line of the prewritten script as displayed on the display screen. In this embodiment, when a user zooms in the words which were all on one line may rearrange so that the words at the end of the line move below to the next line and start the next line of the prewritten script displayed. The words displayed on the remaining lines of the prewritten script are thus rearranged so that the total number of words displayed on each line decrease. Alternatively, in this embodiment, when a user zooms out the words which were on multiple lines rearrange so that the words on the multiple lines combine onto one line. In this manner, words which had started a second line move after the words at the end of the prior line. 
         [0097]    Another component of the invention is a modification of the matching algorithm based on the manual zoom performed by the user. The matching algorithm starts with the creation of a scoped down hypothesis. When a user zooms in or zooms out, the first word of a line changes. The matching algorithm then automatically resets the start position from where it creates hypotheses to the new first word of the line. The matching algorithm may begin to create a new hypothesis which overlaps, fully or partially, with any old hypothesis created prior to the user zooming in or zooming out. The matching algorithm can thus reset and start tracking from the new word position automatically without requiring the user to reset the tracking position. The matching algorithm correctly calibrates based on the size of the font and specific graphical view of the script utilized by a user. 
         [0098]    Each of these components may exist independently of the other components. Each component may be utilized separate from method utilized to track the prewritten script with speech recognition. 
         [0099]    The methods, systems, and components above may be utilized in any fashion and for any purpose. In the preferred embodiment the methods are utilized as methods for a teleprompter. However, other natural uses for the methods may be self-evident as other embodiments without departing from the invention. For instance, and without limiting the scope of the invention, the methods, systems, and components may be utilized for a closed captioning system, a teletype device, TTY or TDD, game, or any other type of auditory device or system or software program utilizing audio. 
         [0100]    What has been described above includes examples of the claimed subject matter. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the claimed subject matter, but one of ordinary skill in the art can recognize that many further combinations and permutations of such matter are possible. Accordingly, the claimed subject matter is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim. 
         [0101]    The foregoing method descriptions and the process flow diagrams are provided merely as illustrative examples and are not intended to require or imply that the steps of the various embodiments must be performed in the order presented. As will be appreciated by one of skill in the art the order of steps in the foregoing embodiments may be performed in any order. Words such as “thereafter,” “then,” “next,” etc. are not intended to limit the order of the steps; these words are simply used to guide the reader through the description of the methods. Further, any reference to claim elements in the singular, for example, using the articles “a,” “an” or “the” is not to be construed as limiting the element to the singular. 
         [0102]    The various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention. 
         [0103]    The hardware used to implement the various illustrative logics, logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but, in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Alternatively, some steps or methods may be performed by circuitry that is specific to a given function. 
         [0104]    In one or more exemplary aspects, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. The steps of a method or algorithm disclosed herein may be embodied in a processor-executable software module, which may reside on a tangible, non-transitory computer-readable storage medium. Tangible, non-transitory computer-readable storage media may be any available media that may be accessed by a computer. By way of example, and not limitation, such non-transitory computer-readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that may be used to store desired program code in the form of instructions or data structures and that may be accessed by a computer. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of non-transitory computer-readable media. Additionally, the operations of a method or algorithm may reside as one or any combination or set of codes and/or instructions on a tangible, non-transitory machine readable medium and/or computer-readable medium, which may be incorporated into a computer program product. 
         [0105]    The preceding description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the following claims and the principles and novel features disclosed herein.