Patent Publication Number: US-9836447-B2

Title: Linguistic error detection

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a Continuation of U.S. patent application Ser. No. 13/193,248, filed on Jul. 28, 2011, and entitled “LINGUISTIC ERROR DETECTION.” 
    
    
     BACKGROUND 
     Non-native English speakers may have trouble with writing sentences that, when read, sound like correct English. For example, the sentence, “Regarding to your request for a reference of Mrs. Green, please find following are her employment records,” might be found confusing when read by a native English language speaker. More specifically, even though the grammar and/or spelling of this sentence may be valid, the meaning and intent of the sentence may be lost because of confusing wording. Accordingly, it is desirable to identify linguistic errors within a sequence of words. 
     SUMMARY 
     The present disclosure is directed to systems and methods for identifying and flagging potential linguistic errors within a sequence of words. 
     In one aspect, a method for detecting a linguistic error within a sequence of words of a sentence is disclosed. The method includes: receiving, from an application executing on a computing device, a plurality of tokens each forming a distinct feature of a first sentence within an electronic document; processing the plurality of tokens, at the computing device, to form at least one partition having at least three sequential tokens of the plurality of tokens; calculating, at the computing device, a first numerical value defined as a probability that the at least three sequential tokens will occur in sequence in a sentence; calculating, at the computing device, a second numerical value defined as a probability that the at least three sequential tokens will randomly occur in a sentence; calculating, at the computing device, a third numerical value based on a comparison of the first numerical value to the second numerical value; comparing the third numerical value to a first threshold value; and evaluating the at least three sequential tokens as having a potential linguistic error upon the third numerical value deviating from the first threshold value. 
     In another aspect, a computing device is disclosed including a processing unit and a system memory connected to the processing unit. The system memory includes instructions that, when executed by the processing unit, cause the processing unit to implement an error detection module configured to detect a linguistic error within a sequence of words of a sentence. The error detection module includes a classification module and a language model module. The classification module is configured to: receive, from an application executing on the computing device, a plurality of tokens each forming a feature of a first sentence within an electronic document of the application; process the plurality of tokens to form at least one partition having at least three sequential tokens of the plurality of tokens; calculate a first numerical value defined as a probability that the at least three sequential tokens will occur in sequence in a sentence; calculate a second numerical value defined as a probability that the at least three sequential tokens will randomly occur in a sentence; calculate a third numerical value based on a comparison of the first numerical value to the second numerical value; compare the third numerical value to a first threshold value; and evaluate the at least three sequential tokens as having a potential linguistic error upon the third numerical value deviating from the first threshold value. The language model module is configured as a data repository to store a statistical N-gram language model formed of a structured set of conditional probabilities assigned to single words and specific sequences of words as derived from a corpus of language text, where numerical values used in calculating the first and second numerical values are retrieved from the language model module by the classification module. 
     In yet another aspect, a computer readable storage medium having computer-executable instructions is disclosed that, when executed by a computing device, cause the computing device to perform steps including: receiving a command configured to instantiate linguistic error detection within at least three sequential tokens of a plurality of tokens each forming a word of a first sentence within an electronic document; parsing the plurality of tokens to form at least one partition having the at least three sequential tokens; calculating a first numerical value defined as a probability that the at least three sequential tokens will occur in sequence in a sentence, the first numerical value is calculated using a first equation having a form:
 
 P ( a,b,c,d,e,f , . . . )= P ( a ) P ( b|a ) P ( c|a,b ) P ( d|a,b,c ) P ( e|a,b,c,d ) P ( f|a,b,c,d,e )= P ( a ) P ( b|a ) P ( c|a,b ) P ( d|b,c ) P ( e|c,d ) P ( f|d,e ),
 
where terms having the form P(a) within the first equation correspond to a uni-gram probability, terms having the form P(b|a) within the first equation correspond to a bi-gram probability, and terms having the form P( c |a,) within the first equation correspond to a tri-gram probability; calculating, a second numerical value defined as a probability that the at least three sequential tokens will randomly occur in a sentence, the second numerical value is calculated using a second equation having a form:
 
 Q ( a,b,c,d,e,f , . . . )= P ( a ) P ( b ) P ( c ) P ( d ) P ( e ) P ( f ),
 
where terms having the form P(a) within the second equation correspond to a uni-gram probability, and where numerical values used in calculating the first and second numerical values are retrieved from a statistical N-gram language model formed of a structured set of conditional probabilities assigned to single words and specific sequences of words as derived from a corpus of language text; calculating a third numerical value based on a comparison of the first numerical value to the second numerical value; evaluating the at least three sequential tokens as having a potential linguistic error upon the third numerical value deviating from a first threshold value and the second numerical value deviating from a second threshold value using an classification function having a form:
 
             y   =     {           1           if   ⁢           ⁢     f   (     a   ,   b   ,   c   ,   d   ,   e   ,   f   ,   …     ⁢           )       &lt;     θ   ⁢           ⁢   and   ⁢           ⁢     ln   ⁡     (     Q   (     a   ,   b   ,   c   ,   d   ,   f   ,   …     ⁢           )     )         &gt;   δ             0       otherwise         ,             
where the classification function evaluated as y=1 corresponds to the at least three sequential tokens as having a potential linguistic error; and emphasizing the at least three sequential tokens, when the classification function is evaluated as y=1, by at least one user perceivable cue selected from a group including: a visual cue; an audio cue; and a tactile cue.
 
     This Summary is provided to introduce a selection of concepts, in a simplified form, that are further described below in the Detailed Description. This Summary is not intended to be used in any way to limit the scope of the claimed subject matter. Rather, the claimed subject matter is defined by the language set forth in the Claims of the present disclosure. 
    
    
     
       DESCRIPTION OF THE DRAWINGS 
       Aspects of the present disclosure may be more completely understood in consideration of the following detailed description of various embodiments in connection with the accompanying drawings. 
         FIG. 1  shows a flowchart for an example method for identifying linguistic errors within a sequence of words. 
         FIG. 2  shows an example networked computing environment. 
         FIG. 3  shows an example computing device of the environment of  FIG. 2 . 
         FIG. 4  shows example logical modules executing on a computing device configured for identifying linguistic errors within a sequence of words. 
         FIG. 5  shows a flowchart for an example method for identifying and flagging linguistic errors within a sequence of words. 
         FIG. 6  shows an example sentence portion flagged for including a potential linguistic error. 
     
    
    
     DETAILED DESCRIPTION 
     The present disclosure is directed to systems and methods for identifying and flagging potential linguistic errors within a sequence of words. 
     In one example embodiment, potential linguistic errors within a sequence of words of a sentence are identified based on analysis of a configurable sliding window. The analysis is performed based on an assumption that if a sequence of words occurs frequently enough within a large, well-formed corpus, its joint probability for occurring in a sentence is very likely to be greater than the same words randomly ordered. 
     Although not so limited, an appreciation of the various aspects of the disclosure will be gained through a discussion of the examples provided below. 
     Referring now to  FIG. 1 , an example method  100  for identifying a linguistic error within a sequence of words is shown. Example linguistic errors include phonological errors, lexical errors, syntactic errors, etc., and can generally be overt (i.e., context insensitive) or covert (i.e., context sensitive) in nature. In one embodiment, the method  100  is implemented on a client computing device, such as described below in connection with  FIGS. 2-4 . Other embodiments are possible. 
     The method  100  begins at a first module  105 . The first module  105  is configured to receive a string of tokens that form at least a partially complete sentence S=(t 1 , t 2 , . . . , t M ). An example sentence S A , in which M=13, includes: “One example algorithm determines a sequence of word whether contains a linguistic error.” In this example, each individual token (t 1 , t 2 , . . . , t 13 ) corresponds to a specific word of the sentence S A . For example, token t 4 =“determines” and token t 9 =“whether.” Other embodiments are possible. For example, a “token” can generally be any perceivable feature of a sentence, such as a syllable, phrase, punctuation mark, space delimiter, carriage return, and others. Still other embodiments are possible. 
     Operational flow then proceeds to a second module  110 . The second module  110  is configured to logically partition the tokens (t 1 , t 2 , . . . , t M ) of the sentence S as received by the first module  105  to form an N-gram U=(v 1 , v 2 , . . . , v N ). An example N-gram U A =(v 1 , v 2 , . . . , v 8 ), in which N=8, includes “algorithm determines a sequence of word whether contains.” In this example, items (v 1 , v 2 , . . . , v 8 ) of the N-gram U A  correspond to an ordered subset of the tokens (t 3 , t 4 , . . . , t 10 ) of the sentence S A . For example, item v 1 =token t 3 =“algorithm” and item v 7 =token t 9 =“whether.” In general, items (v 1 , v 2 , . . . , v N ) of the N-gram U formed by the second module  110  correspond to an ordered set of the tokens (t 1 , t 2 , . . . , t M ) of the sentence S, where N is selectively defined as N≦M. 
     Operational flow then proceeds to a third module  115 . The third module  115  is configured to quantify and compare the likelihood that the specific ordering of the items of the N-gram U formed by the second module  110  will occur in a sentence to the likelihood that the respective items will occur in random order. 
     For example, in one embodiment the third module  115  calculates and compares a probability P that quantifies the probability that the specific sequence “algorithm determines a sequence of word whether contains” of the N-gram U A  will occur in a sentence to a probability Q that the respective items of the N-gram U A  will occur in random order. In one example embodiment, the third module  115  evaluates the N-gram U A  as potentially including a linguistic error when a ratio of the probability P and probability Q is less than unitary (i.e., ln(P/Q)&lt;0). Other embodiments are possible. 
     Operational flow then proceeds to a fourth module  120 . The fourth module  120  is configured to flag one or more specific items (v 1 , v 2 , . . . , V N ) of the N-gram U when at least one potential linguistic error is detected therein by the third module  115 . For example, in one embodiment, the fourth module  120  flags the item v 6 =“word” and/or the item v 7 =“whether” of the N-gram U A  since the item v 6 =“word” should potentially be of plural form, and the positioning of the item v 7 =“whether” within the N-gram U A  may be incorrect. 
     One example implementation of the method  100  is described below in connection with  FIGS. 2-6 . 
     Referring now to  FIG. 2 , an example networked computing environment  200  is shown in which aspects of the present disclosure, including the example method  100  of  FIG. 1 , may be implemented. The example environment  200  includes a client device  205 , a server device  210 , a storage device  215 , and a network  220 . Other embodiments are possible. For example, the environment  200  may generally include more or fewer devices, networks, and other components as desired. 
     The client device  205  and the server device  210  are computing devices, as described in further detail below in connection with  FIG. 3 . In example embodiments, the client device  205  is configured for identifying a linguistic error within a sequence of words in accordance with the present disclosure, and the server device  210  is configured as a business server that that implements business processes that are accessible to the client device  205 . Other embodiments are possible. 
     The storage device  215  is an electronic data storage device, such as a relational database or any other type of persistent data storage device. The storage device  215  stores data in a predefined format such that the server device  210  can query, modify, and manage electronic data stored thereon. Example electronic data includes information related to directory services, authentication services, administration services, and other services such as managed by the ACTIVE DIRECTORY® directory service from Microsoft Corporation. Other embodiments of the storage device  215  are possible. 
     The network  220  is a bi-directional data communication path for data transfer between one or more devices. In the example shown, the network  220  establishes a communication path for data transfer between the client device  205  and the server device  210 . The network  220  can be of any of a number of wireless or hardwired WAN, LAN, Internet, or other packet-based communication networks such that data can be transferred among the elements of the example environment  200 . Other embodiments of the network  220  are possible as well. 
     Referring now to  FIG. 3 , the server device  210  of  FIG. 2  is shown in detail. The server device  210  is a computing device. An example computing device includes an enterprise server, blade server, desktop computer, laptop computer, personal data assistant, smartphone, gaming console, and others. 
     The server device  210  includes at least one processing unit  305  and a system memory  310 . The system memory  310  stores an operating system  315  for controlling the operation of the server device  210  or another computing device. One example operating system is the WINDOWS® operating system from Microsoft Corporation. Other embodiments are possible. 
     The system memory  310  includes one or more software applications  320  and may include program data. Software applications  320  may include many different types of single and multiple-functionality programs, such as a server program, an electronic mail program, a calendaring program, an Internet browsing program, a spreadsheet program, a program to track and report information, a word processing program, and many others. 
     One example program is the Office suite of business applications from Microsoft Corporation. Another example program includes Exchange Server, also from Microsoft Corporation. Exchange Server is an example of a business server that implements messaging and collaborative business processes in support of electronic mail, calendaring, and contacts and tasks features, in support of mobile and web-based access to information, and in support of data storage. Still other programs are possible. 
     The system memory  310  is computer-readable media. Examples of computer-readable media include computer storage media and communication media. Computer storage media is physical media that is distinguished from communication media. 
     Computer storage media includes physical volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer-readable instructions, data structures, program modules, or other data. Computer storage media also includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, DVD or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the server device  210 . Any such computer storage media may be part of or external to the server device  210 . Such storage is illustrated in  FIG. 3  by removable storage  325  and non-removable storage  330 . 
     Communication media is typically embodied by computer-readable instructions, data structures, program modules, or other data, in a modulated data signal, such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. 
     The server device  210  also includes any number and type of an input device  335  and output device  340 . An example input device  335  includes a keyboard, mouse, pen, voice input device, touch input device, motion input device, and others. For example, the input device  335  may be a camera that may be operative to record a user and capture motions and/or gestures made by a user. The input device  335  may be further operative to capture words spoken by a user, such as by a microphone, and/or capture other inputs from user such as by a keyboard and/or mouse. Consistent with embodiments of the present disclosure, the input device  335  may comprise any motion detection device capable of detecting the movement of a user. For example, the input device  335  may comprise a Kinect® motion capture device, from Microsoft Corporation, comprising a plurality of cameras and a plurality of microphones. Other embodiments are possible. 
     An example output device  340  includes a display, speakers, printer, and others. The server device  210  also includes a communication connection  345  configured to enable communications with other computing devices over a network (e.g., network  220  of  FIG. 2 ) in a distributed computing system environment. 
     The client device  205  of  FIG. 2  is also a computing device and is configured in a manner similar to that of the server device  210  described above. In example embodiments, the client device  205  is additionally configured for identifying a linguistic error within a sequence of words in accordance with the present disclosure. 
     For example, referring now to  FIG. 4 , the client device  205  of  FIG. 2  is shown including an application  405  and a linguistic error detection (LED) module  410 . In example embodiments, the application  405  and LED module  410  each include logical modules of software executing on the client device  205 . Other embodiments are possible. For example, in some embodiments, one or more respective components of the application  405  and LED module  410  are at least partially located on the server device  210 , and are accessible to the client device  205  over the network  220  of  FIG. 2 . Still other embodiments are possible. 
     The application  405  is a program configured to enable a user to create, modify, and/or interact with a document  415 . The Office suite of business applications from Microsoft Corporation is one example of such a program. In this example, the document  415  can be any one of an e-mail message, a spreadsheet file, a word processing file, etc. However, a type of the document  415  is only limited by a type of the application  405 . 
     The document  415  as shown includes a plurality of sentences S 1 -S 4 . An example sentence S 1  includes: “They accept 48 hour deadline if translation the words up to 2,000.” An example sentence S 2  includes: “I also ask you for giving me information about the time of the meetings of club&#39;s members.” An example sentence S 3  includes: “Regarding to your request for a reference, please find following are the subjects employment records.” An example sentence S 4  includes: “Finally, before we go to the camp I′d love to go to a big entertainment park cause we haven&#39;t any near in Greece.” 
     While the sentences S 1 -S 4  may exhibit approximately correct or even valid English grammar, the meaning and intent of the sentences S 1 -S 4  may be lost because of confusing wording when read by a native English speaker. The application  405  is configured to invoke functionality of the LED module  410  to detect and flag such errors within the sentences S 1 -S 4  of the document  415 . In general, this enables an author of the sentences S 1 -S 4  to proof the grammar and/or spelling of the sentences S 1 -S 4 . 
     Functionality of the LED module  410  may be manually invoked such as, for example, via user selection of a hotkey (e.g., “F 7 ”) of an input device (not shown) connected to the client device  205 . In another embodiment, functionality of the LED module  410  may be manually invoked via user selection of a button  420  (e.g., via mouse pointer selection) within the document  415 . Other embodiments are possible. 
     For example, the LED module  410  may be automatically invoked such as upon detection of a given punctuation mark (e.g., a “period”) by the application  405  within the sentences S 1 -S 4  of the document  415 . For example, the LED module  410  may be automatically invoked by the application  405  when an author of the sentence S 1  completes the sentence with the “period” punctuation mark. Still other embodiments are possible. 
     The LED module  410  includes a classification module  425  and a language model (LM) module  430 , and is generally configured to implement a linguistic error detection algorithm based on the conjecture that an N-gram will more likely be erroneous when a specific ordering of items of the N-gram (e.g., “algorithm determines a sequence of word whether contains”) is not much different, in terms of probability, from the same items randomly organized (e.g., “word determines sequence contains a whether of algorithm”). 
     For example, referring now additionally to  FIG. 5 , an example method  500  is shown for identifying and flagging potential linguistic errors within a sequence of words (i.e., N-gram) in a sentence. In general, the method  500  is implemented by the LED module  410  of  FIG. 4  based on an assumption that if an N-gram occurs frequently enough within a large, well-formed corpus, its joint probability is very likely to be greater than the same words randomly ordered. An example corpus is described in further detail below. 
     The method begins at an operation  505 . At operation  505 , the classification module  425  of the LED module  410  receives a command to apply a statistical model to a sequence of words within at least one of the plurality of sentences S 1 -S 4  to determine whether the particular sequence of words contains potential linguistic errors. 
     Operational flow then proceeds to an operation  510 . At operation  510 , the classification module  425  of the LED module  410  at least retrieves the sentence S 1  from the document  415 , and forms a partition function F=(F 1 , . . . , F X ) based on a configurable sliding window that defines a number of tokens T within the sentence S 1  that will be processed for error detection at any given time. In general, each respective partition (F 1 , . . . , F X ) forms an N-gram that corresponds to an ordered set of tokens of the sentence S 1 , and the number of tokens T is selectively defined as T≧2. 
     For example, assuming T is predefined as T=6, the example sentence S 1  is partitioned as F=(F 1 , . . . , F 7 ), where F 1 =(They accept 48 hour deadline if); F 2 =(accept 48 hour deadline if translation); F 3 =(48 hour deadline if translation the); F 4 =(hour deadline if translation the words); F 5 =(deadline if translation the words up); F 6 =(if translation the words up to); and F 7 =(translation the words up to 2,000). Other embodiments are possible. 
     Operational flow then proceeds to an operation  515 . At operation  515 , the classification module  425  is configured to calculate a log likelihood ratio for each N-gram defined by the respective partitions (F 1 , . . . , F 7 ). For example, referring to partition F 6 , a log likelihood ratio f(a, b, c, d, e, f) of the N-gram “if translation the words up to” is calculated using the Markov assumption and chain rule as follows.
 
 P ( a,b,c,d,e,f )= P ( a ) P ( b|a ) P ( c|a,b ) P ( d|a,b,c ) P ( e|a,b,c,d ) P ( f|a,b,c,d,e )= P ( a ) P ( b|a ) P ( c|a,b ) P ( d|b,c ) P ( e|c,d ) P ( f|d,e ).  Equation 1
 
     Element “a” corresponds to the item “if” within the partition F 6 , element “b” corresponds to the item “translation” within the partition F 6 , element “c” corresponds to the item “the” within the partition F 6 , element “d” corresponds to the item “words” within the partition F 6 , element “e” corresponds to the item “up” within the partition F 6 , and element “f” corresponds to the item “to” within the partition F 6 . 
     In contrast, with reference to partition F 5 , element “a” corresponds to the item “deadline” within the partition F 5 , element “b” corresponds to the item “if” within the partition F 5 , element “c” corresponds to the item “translation” within the partition F 5 , element “d” corresponds to the item “the” within the partition F 5 , element “e” corresponds to the item “words” within the partition F 5 , and element “f” corresponds to the item “up” within the partition F 5 . 
     In example embodiments, the number of elements or arguments of the log likelihood ratio f( ) corresponds the number of tokens T. For example, when T=5, the log likelihood ratio is defined as f(a, b, c, d, e), etc. 
     Continuing with the example of partition F 6 , the example function P(a, b, c, d, e, f) corresponds to a probability that the specific sequence “if translation the words up to” will occur in a sentence, and is simplified under the assumption that each word or item within the sentence S 1  depends only on the immediately preceding two words (i.e., “tri-gram model”). Other embodiments are possible. For example, the function P(a, b, c, d, e, f) can be selectively derived under the assumption that each word or item within the sentence S 1  depends on any number of preceding words (i.e., “multi-gram model”). In practice, the complexity of the function P(a, b, c, d, e, f) is only limited by completeness of a corresponding language model within the LM module  430 , described in further detail below. 
     The term P(a) within the function P(a, b, c, d, e, f) corresponds to a uni-gram probability that the item “if” (i.e., a≡“if”) would occur anywhere in a hypothetical sentence, the term P(b|a) corresponds to a bi-gram probability that the term “translation” (i.e., b≡“translation”) would occur in a hypothetical sentence given that the term “if” occurs in sequence immediately before the term “translation” in the same sentence, and the term P(c|a,b) corresponds to a tri-gram probability that the item “the” (i.e., c≡“the”) would occur in a hypothetical sentence given that the terms “if” and “translation” occur in sequence immediately before the term “the” in the same sentence. The terms P(d|b,c), P(e|c,d), and P(f|d, e) are also tri-gram probabilities determined in a manner similar to P(c|a,b).
 
 Q ( a,b,c,d,e,f )= P ( a ) P ( b ) P ( c ) P ( d ) P ( e ) P ( f ).  Equation 2
 
     The example function Q(a, b, c, d, e, f) quantifies the probability that the items in the N-gram “if translation the words up to” will occur in random order based on the assumption that each of the corresponding elements (a, b, c, d, e, f) are independent variables. In this manner, the terms P(a), P(b), P(c), P(d), P(e), and P(f) within the function Q(a, b, c, d, e, f) represent a uni-gram probability that the corresponding item would occur anywhere in a hypothetical sentence. 
     
       
         
           
             
               
                 
                   
                     f 
                     ⁡ 
                     
                       ( 
                       
                         a 
                         , 
                         b 
                         , 
                         c 
                         , 
                         d 
                         , 
                         e 
                         , 
                         f 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       ln 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         
                           P 
                           ⁡ 
                           
                             ( 
                             
                               a 
                               , 
                               b 
                               , 
                               c 
                               , 
                               d 
                               , 
                               e 
                               , 
                               f 
                             
                             ) 
                           
                         
                         
                           Q 
                           ⁡ 
                           
                             ( 
                             
                               a 
                               , 
                               b 
                               , 
                               c 
                               , 
                               d 
                               , 
                               e 
                               , 
                               f 
                             
                             ) 
                           
                         
                       
                     
                     = 
                     
                       
                         
                           ln 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             P 
                             ⁡ 
                             
                               ( 
                               
                                 a 
                                 , 
                                 b 
                                 , 
                                 c 
                                 , 
                                 d 
                                 , 
                                 e 
                                 , 
                                 f 
                               
                               ) 
                             
                           
                         
                         - 
                         
                           ln 
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             Q 
                             ⁡ 
                             
                               ( 
                               
                                 a 
                                 , 
                                 b 
                                 , 
                                 c 
                                 , 
                                 d 
                                 , 
                                 e 
                                 , 
                                 f 
                               
                               ) 
                             
                           
                         
                       
                       = 
                       
                         
                           
                             ln 
                             ⁡ 
                             
                               ( 
                               
                                 
                                   
                                     
                                       
                                         P 
                                         ⁡ 
                                         
                                           ( 
                                           a 
                                           ) 
                                         
                                       
                                       ⁢ 
                                       
                                         P 
                                         ⁡ 
                                         
                                           ( 
                                           
                                             b 
                                             | 
                                             a 
                                           
                                           ) 
                                         
                                       
                                       ⁢ 
                                       
                                         P 
                                         ⁡ 
                                         
                                           ( 
                                           
                                             
                                               c 
                                               | 
                                               a 
                                             
                                             , 
                                             b 
                                           
                                           ) 
                                         
                                       
                                       ⁢ 
                                       
                                         P 
                                         ⁡ 
                                         
                                           ( 
                                           
                                             
                                               d 
                                               | 
                                               b 
                                             
                                             , 
                                             c 
                                           
                                           ) 
                                         
                                       
                                     
                                   
                                 
                                 
                                   
                                     
                                       P 
                                       ⁢ 
                                       
                                         ( 
                                         
                                           
                                             e 
                                             | 
                                             c 
                                           
                                           , 
                                           d 
                                         
                                         ) 
                                       
                                       ⁢ 
                                       
                                         P 
                                         ⁡ 
                                         
                                           ( 
                                           
                                             
                                               f 
                                               | 
                                               d 
                                             
                                             , 
                                             e 
                                           
                                           ) 
                                         
                                       
                                     
                                   
                                 
                               
                               ) 
                             
                           
                           - 
                           
                             ln 
                             ⁡ 
                             
                               ( 
                               
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     a 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     b 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     c 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     d 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     e 
                                     ) 
                                   
                                 
                                 ⁢ 
                                 
                                   P 
                                   ⁡ 
                                   
                                     ( 
                                     f 
                                     ) 
                                   
                                 
                               
                               ) 
                             
                           
                         
                         = 
                         
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 a 
                                 ) 
                               
                             
                           
                           + 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 
                                   b 
                                   | 
                                   a 
                                 
                                 ) 
                               
                             
                           
                           + 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 
                                   
                                     c 
                                     | 
                                     a 
                                   
                                   , 
                                   b 
                                 
                                 ) 
                               
                             
                           
                           + 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 
                                   
                                     d 
                                     | 
                                     b 
                                   
                                   , 
                                   c 
                                 
                                 ) 
                               
                             
                           
                           + 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 
                                   
                                     e 
                                     | 
                                     c 
                                   
                                   , 
                                   d 
                                 
                                 ) 
                               
                             
                           
                           + 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 
                                   
                                     f 
                                     | 
                                     d 
                                   
                                   , 
                                   e 
                                 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 a 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 b 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 c 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 d 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               P 
                               ⁡ 
                               
                                 ( 
                                 e 
                                 ) 
                               
                             
                           
                           - 
                           
                             ln 
                             ⁢ 
                             
                                 
                             
                             ⁢ 
                             
                               
                                 P 
                                 ⁡ 
                                 
                                   ( 
                                   f 
                                   ) 
                                 
                               
                               . 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   Equation 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   3 
                 
               
             
           
         
       
     
     The example function f(a, b, c, d, e, f) quantifies a log likelihood ratio for the N-gram of partition F 6 , and in the example embodiment may be calculated as:
 
ln  P ( a )=ln  P (if)=−6.71605
 
ln  P ( b )=ln  P (translation)=−11.919;
 
ln  P ( c )=ln  P (the)=−3.10451;
 
ln  P ( d )=ln  P (words)=−9.63201;
 
ln  P ( e )=ln  P (up)=−6.53403;
 
ln  P ( f )=ln  P (to)=−3.93333;
 
ln  P ( b|a )=ln  P (translation|if)=−14.3737;
 
ln  P ( c|a,b )=ln  P (the|if,translation)=−7.87373;
 
ln  P ( d|b,c )=ln  P (words|translation,the)=−8.22497;
 
ln  P ( e|c,d )=ln  P (up|the,words)=−8.80215; and
 
ln  P ( f|d,e )=ln  P (to|words,up)=−2.26877.
 
     Numerical values used in calculating each of the respective natural log probabilities are retrieved from the LM module  430  by the classification module  425 . In example embodiments, the LM module  430  is a repository comprising a statistical N-gram language model formed of a structured set of conditional probabilities assigned to single words and specific sequences of words as derived from a corpus of text. The N-gram language model additionally deals with issues such as “out-of-vocabulary terms.” For example, if a specific N-gram is not present within the N-gram language model, a relatively small non-zero default value is used. An example of such a corpus of text includes a collection of phrases and terms generated by non-native English speakers. Other embodiments are possible. 
     Plugging the above-values into the function f(a, b, c, d, e, f), the log likelihood ratio for the N-gram “if translation the words up to” is evaluated as −6.42044. The log likelihood ratio for each N-gram defined by the respective partitions (F 1 , . . . , F 7 ) are calculated in this manner. 
     Following calculation of the log likelihood ratio for each N-gram defined by the respective partitions (F 1 , . . . , F 7 ) at operation  515 , operational flow proceeds to an operation  520 . At operation  520 , values for f(a, b, c, d, e, f) and Q(a, b, c, d, e, f) for each of the partitions (F 1 , . . . , F 7 ) are compared against a corresponding predetermined threshold value to verify the validity of the respective calculations. 
     
       
         
           
             
               
                 
                   y 
                   = 
                   
                     { 
                     
                       
                         
                           
                             1 
                           
                           
                             
                               
                                 
                                   
                                     
                                       if 
                                       ⁢ 
                                       
                                           
                                       
                                       ⁢ 
                                       
                                         f 
                                         ⁡ 
                                         
                                           ( 
                                           
                                             a 
                                             , 
                                             b 
                                             , 
                                             c 
                                             , 
                                             d 
                                             , 
                                             e 
                                             , 
                                             f 
                                           
                                           ) 
                                         
                                       
                                     
                                     &lt; 
                                     
                                       θ 
                                       ⁢ 
                                       
                                           
                                       
                                       ⁢ 
                                       and 
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       ln 
                                       ⁢ 
                                       
                                         ( 
                                         
                                           Q 
                                           ⁡ 
                                           
                                             ( 
                                             
                                               a 
                                               , 
                                               b 
                                               , 
                                               c 
                                               , 
                                               d 
                                               , 
                                               e 
                                               , 
                                               f 
                                             
                                             ) 
                                           
                                         
                                         ) 
                                       
                                     
                                     &gt; 
                                     δ 
                                   
                                 
                               
                             
                           
                         
                         
                           
                             0 
                           
                           
                             otherwise 
                           
                         
                       
                       . 
                     
                   
                 
               
               
                 
                   Equation 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   4 
                 
               
             
           
         
       
     
     The example classification function y is used to verify whether one or more of the partitions (F 1 , . . . , F 7 ) includes at least one potential linguistic error. A given partition is evaluated as including at least one potential linguistic error when y is evaluated as 1. For example, the log likelihood ratio, evaluated as −6.42044, for the N-gram “if translation the words up to” of partition F 6 , is compared to a first predetermined threshold value θ, and the natural log of the function Q(a, b, c, d, e, f), evaluated as −41.839 based on the above-example numerical values, is compared to a second predetermined threshold value δ. 
     In example embodiments, each of the first predetermined threshold value θ and the second predetermined threshold value δ are defined through a training process based on the structured set of conditional probabilities within the LM module  430 . In other words, precisions and recall is measured using different threshold values to decide which values to use for a given application. Example values for the first predetermined threshold value θ and the second predetermined threshold value δ include “0” and “−45” respectively. In this example, the N-gram “if translation the words up to” is deemed to include at least one valid linguistic error (i.e., f(a, b, c, d, e, f)=−6.42044&lt;θ≡0 and ln Q(a, b, c, d, e, f)=−41.839&gt;δ≡−45). 
     Other embodiments are possible. For example, in some embodiments, the N-gram “if translation the words up to” is deemed to include at least one valid linguistic error upon only the numerical value of the function f(a, b, c, d, e, f) deviating from the first predetermined threshold value θ. Still other embodiments are possible. 
     Following evaluation of partition threshold criteria at operation  520 , operational flow then proceeds to an operation  525  in which those specific partitions (F 1 , . . . , F 7 ) evaluated as having one or more potential linguistic errors are flagged for user identification. 
     For example, referring now additionally to  FIG. 6 , the example sentence S 1  is shown within document  415  in which the N-gram “if translation the words up to” of partition F 6  is underlined to indicate that a potential linguistic error exists within this phrase. Other embodiments are possible. For example, the subject phrase may be emphasized by any number of different perceivable cues that relay information to a user such as, for example, a visual cue (e.g., altered font size, color, underlining, etc. as rendered within document  415 ), an audio cue (e.g., system beep generated by client device  205 , etc.), a tactile cue (vibration generated by client device  205 , etc.), and others. 
     The example embodiments described herein can be implemented as logical operations in a computing device in a networked computing system environment. The logical operations can be implemented as: (i) a sequence of computer implemented instructions, steps, or program modules running on a computing device; and (ii) interconnected logic or hardware modules running within a computing device. 
     In general, the logical operations can be implemented as algorithms in software, firmware, analog/digital circuitry, and/or any combination thereof, without deviating from the scope of the present disclosure. The software, firmware, or similar sequence of computer instructions can be encoded and stored upon a computer readable storage medium and can also be encoded within a carrier-wave signal for transmission between computing devices. 
     For example, embodiments of the present disclosure may be practiced via a system-on-a-chip (SOC) where each or many of the components illustrated in  FIG. 3  may be integrated onto a single integrated circuit. Such an SOC device may include one or more processing units, graphics units, communications units, system virtualization units and various application functionality all of which are integrated (e.g., “burned”) onto the chip substrate as a single integrated circuit. When operating via an SOC, the functionality, described above, with respect to the present disclosure may be operated via application-specific logic integrated with other components of the computing device/system on the SOC. Other embodiments are possible. 
     Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.