EP3207465A1 - Système et procédé pour une détection de langue - Google Patents

Système et procédé pour une détection de langue

Info

Publication number
EP3207465A1
EP3207465A1 EP14790972.5A EP14790972A EP3207465A1 EP 3207465 A1 EP3207465 A1 EP 3207465A1 EP 14790972 A EP14790972 A EP 14790972A EP 3207465 A1 EP3207465 A1 EP 3207465A1
Authority
EP
European Patent Office
Prior art keywords
language
message
user
score
classifiers
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP14790972.5A
Other languages
German (de)
English (en)
Inventor
Nikhil BOJJA
Pidong WANG
Fredrik LINDER
Bartlomiej Puzon
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
MZ IP Holdings LLC
Original Assignee
Machine Zone Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Machine Zone Inc filed Critical Machine Zone Inc
Publication of EP3207465A1 publication Critical patent/EP3207465A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/263Language identification

Definitions

  • the present disclosure relates to language detection and, in particular, to systems and methods for detecting languages in short text messages.
  • language detection or identification is a process in which a language present in a body of text is detected automatically based on the content of the text.
  • Language detection is useful in the context of automatic language translation, where the language of a text message must generally be known before the message can be translated accurately into a different language.
  • chat text domain a particularly challenging domain
  • messages often include only a few words (e.g., four or less), some or all of which may be informal and/or misspelled.
  • chat text domain existing language detection approaches have proven to be inaccurate and/or slow, given the lack of information and the informalities present in such messages.
  • Embodiments of the systems and methods described herein are used to detect the language in a text message based on, for example, content of the message, information about the keyboard used to generate the message, and/or information about the language preferences of the user who generated the message. Compared to previous language detection techniques, the systems and methods described herein are generally faster and more accurate, particularly for short text messages (e.g., of four words or less).
  • the systems and methods use a plurality of language detection tests and classifiers to determine probabilities associated with possible languages in a text message. Each language detection test may output a set or vector of probabilities associated with the possible languages. The classifiers may combine the output from the language detection tests to determine a most likely language for the message.
  • the particular language detection test(s) and classifier(s) chosen for the message may depend on a predicted accuracy, a confidence score, and/or a linguistic domain for the message.
  • the invention relates to a computer-implemented method of identifying a language in a message.
  • the method includes: performing a plurality of different language detection tests on a message associated with a user, each language detection test determining a respective set of scores, each score in the set of scores representing a likelihood that the message is in one of a plurality of different languages; providing one or more combinations of the score sets as input to one or more distinct classifiers; obtaining as output from each of the one or more classifiers a respective indication that the message is in one of the plurality of different languages, the indication including a confidence score; and identifying the language in the message as being the indicated language from one of the one or more classifiers, based on at least one of the confidence score and an identified linguistic domain.
  • the message includes two or more of the following: a letter, a number, a symbol, and an emoticon.
  • the plurality of different language detection tests may include at least two methods selected from the group consisting of a byte n-gram method, a dictionary-based method, an alphabet-based method, a script-based method, and a user language profile method.
  • the plurality of different language detection tests may be performed simultaneously (e.g., with parallel processing).
  • the one or more combinations may include score sets from a byte n-gram method and a dictionary-based method.
  • the one or more combinations may further include score sets from the user language profile method and/or the alphabet-based method.
  • the invention in another aspect, relates to a system for identifying a language in a message.
  • the system includes a computer storage device having instructions stored thereon.
  • the system also includes a data processing apparatus configured to execute the instructions to perform operations that include: performing a plurality of different language detection tests on a message associated with a user, each language detection test determining a respective set of scores, each score in the set of scores representing a likelihood that the message is in one of a plurality of different languages; providing one or more combinations of the score sets as input to one or more distinct classifiers; obtaining as output from each of the one or more classifiers a respective indication that the message is in one of the plurality of different languages, the indication including a confidence score; and identifying the language in the message as being the indicated language from one of the one or more classifiers, based on at least one of the confidence score and an identified linguistic domain.
  • the message includes two or more of the following: a letter, a number, a symbol, and an emoticon.
  • the plurality of different language detection tests may include at least two methods selected from the group consisting of a byte n-gram method, a dictionary-based method, an alphabet-based method, a script-based method, and a user language profile method.
  • the plurality of different language detection tests may be performed simultaneously (e.g., with parallel processing).
  • the one or more combinations may include score sets from a byte n-gram method and a dictionary-based method.
  • the one or more combinations may further include score sets from the user language profile method and/or the alphabet-based method.
  • the invention in another aspect, relates to a computer program product stored in one or more storage devices for controlling a processing mode of a data processing apparatus.
  • the computer program product is executable by the data processing apparatus to cause the data processing apparatus to perform operations that include: performing a plurality of different language detection tests on a message associated with a user, each language detection test determining a respective set of scores, each score in the set of scores representing a likelihood that the message is in one of a plurality of different languages; providing one or more combinations of the score sets as input to one or more distinct classifiers; obtaining as output from each of the one or more classifiers a respective indication that the message is in one of the plurality of different languages, the indication including a confidence score; and identifying the language in the message as being the indicated language from one of the one or more classifiers, based on at least one of the confidence score and an identified linguistic domain.
  • the message includes two or more of the following: a letter, a number, a symbol, and an emoticon.
  • the plurality of different language detection tests may include at least two methods selected from the group consisting of a byte n-gram method, a dictionary-based method, an alphabet-based method, a script-based method, and a user language profile method.
  • the plurality of different language detection tests may be performed simultaneously (e.g., with parallel processing).
  • the one or more combinations may include score sets from a byte n-gram method and a dictionary-based method.
  • the one or more combinations may further include score sets from the user language profile method and/or the alphabet-based method.
  • FIG. 1A is a diagram of an example system for performing language detection.
  • FIG. IB is a flowchart of an example method of detecting a language in a text message.
  • FIG. 2 is a flowchart of an example n-gram method of detecting a language in a text message.
  • FIG. 3 is a flowchart of an example dictionary-based method of detecting a language in a text message.
  • FIG. 4 is a flowchart of an example alphabet-based method of detecting a language in a text message.
  • FIG. 5 is a flowchart of an example script-based method of detecting a language in a text message.
  • FIG. 6 is a flowchart of an example user language profile method of detecting a language in a text message.
  • FIG. 7 is a schematic diagram of an example language detection method module.
  • FIG. 8 is a schematic diagram of an example classifier module.
  • FIG. 9 is a flowchart of an example method of detecting a language in a text message using the language detection method module of FIG. 7 and the classifier module of FIG. 8.
  • FIG. 10 is a flowchart of an example method of detecting a language in a text message.
  • FIG. 1 1 is a flowchart of an example method of detecting a language in a text message.
  • FIG. 12 is a flowchart of an example method of detecting a language in a text message.
  • the language detection systems and methods described herein can be used to identify the language in a text message when language information for the message (e.g., keyboard information from a client device) is absent, malformed or unreliable.
  • language information for the message e.g., keyboard information from a client device
  • the systems and methods improve the accuracy of language translation methods used to translate text messages from one language to another.
  • Language translation generally requires the source language to be identified accurately, otherwise the resulting translation may be inaccurate.
  • FIG. 1A illustrates an example system 10 for detecting a language in a message, such as a text message or an audio message.
  • a server system 12 provides message analysis and language detection functionality.
  • the server system 12 comprises software components and databases that can be deployed at one or more data centers 14 in one or more geographic locations, for example.
  • the server system 12 software components comprise a detection method module 16, a classifier module 18, and a manager module 20.
  • the software components can comprise subcomponents that can execute on the same or on different individual data processing apparatus.
  • the server system 12 databases comprise training data 22, dictionaries 24, alphabets 26, scripts 28, and user profile information 30.
  • the databases can reside in one or more physical storage systems. The software components and data will be further described below.
  • An application such as a web-based application can be provided as an end-user application to allow users to provide messages to the server system 12.
  • the end-user applications can be accessed through a network 32 by users of client devices, such as a personal computer 34, a smart phone 36, a tablet computer 38, and a laptop computer 40.
  • client devices such as a personal computer 34, a smart phone 36, a tablet computer 38, and a laptop computer 40.
  • client devices are possible.
  • the user messages may be accompanied by information about the devices used to create the messages, such as information about the keyboard, client device, and/or operating system used to create the messages.
  • 1A depicts the classifier module 18 and the manager module 20 as being connected to the databases (i.e., training data 22, dictionaries 24, alphabets 26, scripts 28, and user profile information 30), the classifier module 18 and/or the manager module 20 are not necessarily connected to some or all of the databases.
  • the classifier module 18 receives input from the detection method module 16, and the manager module 20 receives input from the classifier module 18. No other inputs are required to be received by the classifier module 18 and/or the manager module 20.
  • FIG. IB illustrates an example method 100 that uses the system 10 to detect a language in a message.
  • the method 100 begins by receiving or obtaining (step 102) a text message generated by a user.
  • the text message is analyzed (step 104) using one or more language detection methods (e.g., from the detection method module 16) that each provide an indication of the language or languages present in the message.
  • the output from the language detection methods is then combined (step 106) using one or more classifiers (e.g., from the classifier module 18) that provide a further indication of the language present in the message.
  • the one or more classifiers may include, for example, a supervised learning model, a partially supervised learning model, an unsupervised learning model, and/or an interpolation.
  • the output from the one or more classifiers is then used to determine (step 108) the language in the message (e.g., using the manager module 20).
  • the language indication from the one or more classifiers is selected by the manager module 20 according to a computed confidence score and/or a linguistic domain.
  • the classifiers may compute a confidence score indicating a degree of confidence associated with the language prediction.
  • certain classifier output may be selected according to the linguistic domain associated with the user or the message. For example, if the message originated in a computer gaming environment, a particular classifier output may be selected as providing the most accurate language prediction. Likewise, if the message originated in the context of sports (e.g., regarding a sporting event), a different classifier output may be selected as being more appropriate for the sports linguistic domain.
  • linguistic domains include, for example, news, parliamentary proceedings, politics, health, travel, web pages, newspaper articles, and microblog messages.
  • certain language detection methods or combinations of language detection methods may be more accurate for certain linguistic domains, when compared to other linguistic domains.
  • the domain can be determined based on the presence of words from a domain vocabulary in a message.
  • a domain vocabulary for computer gaming could include common slang words used by gamers.
  • the language detection methods used by the detection method module 16 may include, for example, an n-gram method (e.g., a byte n-gram method), a dictionary-based method, an alphabet-based method, a script-based method, and a user language profile method. Other language detection methods are possible. Each of these language detection methods may be used to detect a language present in a message.
  • the output from each method may be, for example, a set or vector of probabilities associated with each possible language in the message. In some instances, two or more of the language detection methods may be performed simultaneously, using parallel computing, which can reduce computation times considerably.
  • a byte n-gram method uses byte n-grams instead of word or character n-grams to detect languages.
  • the byte n-gram method is preferably trained over a mixture of byte n-grams (e.g., with 1 ⁇ n ⁇ 4), using a naive Bayes classifier having a multinomial event model.
  • the model preferably generalizes to data from different linguistic domains, such that the model's default configuration is accurate over a diverse set of domains, including newspaper articles, online gaming, web pages, and microblog messages. Information about the language identification task may be integrated from a variety of domains.
  • the task of attaining high accuracy may be relatively easy for language identification in a traditional text categorization setting, for which in-domain training data is available. This task may be more difficult when attempting to use learned model parameters for one linguistic domain to classify or categorize data from a separate linguistic domain. This problem may be addressed by focusing on important features that are relevant to the task of language identification. This may be based on, for example, a concept called information gain, which was originally introduced for decision trees as a splitting criteria, and later found to be useful for selecting features in text categorization.
  • a detection score is calculated that represents the difference in information gain relative to domain and language. Features having a high detection score may provide information about language without providing information about domain. For simplicity, the candidate feature set may be pruned before information gain is calculated, by means of a feature selection based on term- frequency.
  • an example byte n-gram method 200 begins by training the method using the training data 22.
  • the method may be trained over a mixture of byte n-grams, using the naive Bayes classifier having the multinomial event model.
  • Training data 22 is preferably collected (step 202) for a wide number and variety of languages and adjusted so that the amount of data available per language is made uniform.
  • a small portion of the training data 22 is set aside (step 204) as a test set.
  • a byte n-gram model is trained (step 206) on the data 22 with appropriate smoothing and backoff techniques.
  • the input features to the model are byte streams from each input sentence, and since the source language label is known for these sentences, the model adjusts its parameters to learn byte sequences typical to a given language.
  • the test set that was isolated in the beginning is then used to predict (step 208) language labels based on the model that had been trained.
  • the accuracy of prediction gives the performance of this byte n-gram language identification system.
  • these byte n-gram systems are typically trained to cater to a generic domain and not to any specific domains.
  • the trained model may be compiled (step 210) into a program along with intermediate machine parameters.
  • the program may serve as a general purpose language identification system.
  • the dictionary-based language detection method counts the number of tokens or words belonging to each language by looking up words in a dictionary or other word listing associated with the language.
  • the language having the most words in the message is chosen as the best language. In the case of multiple best languages, the more frequent or commonly used of the best languages may be chosen.
  • the language dictionaries may be stored in the dictionaries database 24.
  • FIG. 3 is a flowchart of an example dictionary-based language detection method 300.
  • a text message is provided (step 302) and a set of possible languages for the text message is identified (step 304).
  • a first possible language is then chosen (step 306) from the set.
  • the words in the text message that are present in a dictionary for the possible language are counted (step 308). If additional possible languages from the set have not yet been considered (step 310), a new possible language is selected (step 312), and step 308 is repeated. Once all possible languages from the set have been considered, the language with the most words in the text message may be identified (step 314) as the language in the message.
  • the method may be used to compute the likelihood that a language is in the message, for each language in the set.
  • the output from the dictionary-based method may be a vector of probabilities for each language in the set.
  • dictionaries that include informal words or chat words (e.g., abbreviations, acronyms, slang words, and profanity), in additional to formal words.
  • Informal words are commonly used in short text communications and in chat rooms.
  • the dictionaries are preferably augmented to include informal words on an ongoing basis, as new informal words are developed and used.
  • the alphabet-based method is generally based on character counts for each language's alphabet and relies on the observation that many languages have unique alphabets or different sets of characters. For example, Russian, English, Korean, and Japanese each use a different alphabet. Although the alphabet-based method may be unable to distinguish some languages precisely (e.g., languages that use similar alphabets, such as Latin languages), the alphabet- based method can generally detect certain languages quickly. In some instances it is preferable to use the alphabet-based method in combination with one or more other language detection methods (e.g., using a classifier), as discussed herein.
  • the language alphabets may be stored in the alphabets database 26.
  • FIG. 4 is a flowchart of an example alphabet-based language detection method 400.
  • a text message is provided (step 402) and a set of possible languages for the text message is identified (step 404).
  • a first possible language is then chosen (step 406) from the set.
  • the characters in the text message that are present in an alphabet for the possible language are counted (step 408). If additional possible languages from the set have not yet been considered (step 410), a new possible language is selected (step 412), and step 408 is repeated. Once all possible languages from the set have been considered, the language with the most characters in the text message may be identified (step 414) as the language in the message.
  • the alphabet-based method may be used to compute a likelihood that a language is in the message, for each language in the set.
  • the output from the alphabet-based method may be a vector of probabilities for each language in the set.
  • the script-based language detection method determines the character counts for each possible script (e.g. Latin script, CJK script, etc.) that is present in the message.
  • the script-based method relies on the observation that different languages may use different scripts, e.g., Chinese and English.
  • the method preferably uses a mapping that maps a script to a list of languages that use the script. For example, the mapping may consider the UNICODE values for the characters or symbols present in the message, and these UNICODE values may be mapped to a corresponding language or set of possible languages for the message.
  • the language scripts and UNICODE values or ranges may be stored in the scripts database 28.
  • a text message is provided (step 502) and the scripts present in the message are identified (504).
  • the number of characters falling into each script is then counted (step 506).
  • the script with the highest number of characters is considered to be the best script (step 508), and the languages corresponding to the best script are identified (step 510).
  • the best script corresponds to only one language, that language may be considered to be the best language. Otherwise, when the best script corresponds more than one language, additional language detection methods may be used to do further detection.
  • the output from the script-based method is a set of probabilities (e.g., in vector form) for each possible language in the message.
  • the user language profile based method uses the user profiles database 30, which stores historical messages sent by various users.
  • the languages of these stored messages are detected using, for example, one or more other language detection methods described herein (e.g., the byte n-gram method), to identify the language(s) used by each user. For example, if all of a user's prior messages are in Spanish, the language profile for that user may indicate the user's preferred language is Spanish. Likewise, if a user's prior messages are in a mixture of different languages, the language profile for the user may indicate probabilities associated with the different languages (e.g., 80% English, 15% French, and 5% Spanish).
  • the user language profile based method addresses language detection issues associated with very short messages, which often do not have enough information in them to make an accurate language determination.
  • the language preference of a user can be used to predict the language(s) in the user's messages, by assuming the user will continue to use the language(s) he or she has used previously.
  • an example user language profile detection method 600 begins by storing (step 602) a user's previous messages and detecting (step 604) the language(s) present in the stored messages. The frequency with which different language(s) appear in the user's message is determined (606) and outputted (step 608).
  • the various language detection methods may be incorporated into the detection method module 16.
  • a text message may be input into the detection method module 16, and one or more of the language detection methods may identify the language(s) in the message.
  • each language detection method may provide a vector of probabilities where each probability in the vector is associated with a possible language in the message and represents the likelihood that the message is in the given language. Due to the different methods employed and the information available in the message, the probabilities from each language detection method may not be consistent.
  • the detection method module 16 may include or utilize, for example, an n-gram module 702 for performing an n-gram detection method (e.g., the byte n-gram detection method 200), a dictionary-based module 704 for performing the dictionary-based method 300, an alphabet-based module 706 for performing the alphabet-based method 400, a script-based module 708 for performing the script-based method 500, and a user language profile module 710 for performing the user language profile method 600. Additional language detection methods may be incorporated into the detection method module 16, as desired. Some known methods include using word level n-grams, Markov models, and predictive modeling techniques.
  • the classifier module 18 may include an interpolation module 802, a support vector machines (SVM) module 804, and a linear SVM module 806.
  • the interpolation module 802 is used to perform a linear interpolation of the results from two or more language detection methods.
  • the language of a text message may be determined by interpolating between results from the byte n-gram method and the dictionary-based method.
  • the byte n-gram method may determine the likelihood of English is 0.3, the likelihood of French is 0.4, and the likelihood of Polish is 0.3 (e.g., the output from the byte n-gram method may be ⁇ en:0.3, fr:0.4, pl:0.3 ⁇ ).
  • the dictionary-based method may determine the likelihood of English is 0.1, the likelihood of French is 0.2, and the likelihood of Polish is 0.7 (e.g., the output may be ⁇ en:0.1, fr:0.2, pl:0.7 ⁇ ).
  • the output from the byte n- gram is multiplied by a first weight and the output from the dictionary-based method is multiplied by a second weight, such that the first and second weights add to one.
  • the weighted outputs from the two methods are then added together.
  • the optimal weights for interpolating between two or more values may be determined numerically through trial and error. Different weights can be tried to identify the best set of weights for a given set of messages.
  • the weights may be a function of the number of words or characters in the message. Alternatively or additionally, the weights may depend on the linguistic domain of the message. For example, the optimal weights for a gaming environment may be different than the optimal weights for a sports environment. For a combination of the byte n-gram method and the dictionary-based method, good results may be obtained using a weight of 0.1 on the byte n-gram method and a weight of 0.9 on the dictionary-based method.
  • the SVM module 804 may be or include a supervised learning model that analyzes language data and recognizes language patterns.
  • the SVM module 804 may be a multi-class SVM classifier, for example.
  • the feature vector may be the concatenation of the two distributions above (i.e., ⁇ en:0.3, fr:0.4, pl:0.3, en:0.1, fr:0.2, pl:0.7 ⁇ ).
  • the SVM classifier is preferably trained on labeled training data.
  • the trained model acts as a predictor for an input.
  • the features selected in the case of language detection may be, for example, sequences of bytes, words, or phrases.
  • Input training vectors may be mapped into a multi-dimensional space.
  • the SVM algorithm may then use kernels to identify the optimal separating hyplerplane between these dimensions, which will give the algorithm a
  • the kernel may be, for example, a linear kernel, a polynomial kernel, or a radial basis function (RBF) kernel.
  • a preferred kernel for the SVM classifier is the RBF kernel.
  • the classifier After training the SVM classifier using training data, the classifier may be used to output a best language among all the possible languages.
  • the training data may be or include, for example, the output vectors from different language detection methods and an indication of the correct language, for a large number of messages having, for example, different message lengths, linguistic domains, and/or languages.
  • the training data may include a large number of messages for which the language in each message is known.
  • the linear SVM module 806 may be or include a large-scale linear classifier.
  • An SVM classifier with a linear kernel may perform better than other linear classifiers, such as linear regression.
  • the linear SVM module 806 differs from the SVM module 804 at the kernel level. There are some cases when a polynomial model works better than a linear model, and vice versa.
  • the optimal kernel may depend on the linguistic domain of the message data and/or the nature of the data.
  • classifiers used by the systems and methods described herein include, for example, decision tree learning, association rule learning, artificial neural networks, inductive logic programming, random forests, clustering, Bayesian networks, reinforcement learning, representation learning, similarity and metric learning, and sparse dictionary learning.
  • decision tree learning association rule learning
  • artificial neural networks inductive logic programming
  • random forests clustering
  • Bayesian networks Bayesian networks
  • reinforcement learning representation learning
  • similarity and metric learning and sparse dictionary learning
  • sparse dictionary learning sparse dictionary learning.
  • One or more of these classifiers, or other classifiers may be incorporated into and/or form part of the classifier module 18.
  • an example method 900 uses the detection method module 16, the classifier module 18, and the manager module 20 to detect the language in a message.
  • the message is provided or delivered (step 902) to the detection method module 16.
  • the message may be accompanied by information about the message and/or the user who generated the message.
  • the information may include, for example, an identification number for the user, information about the keyboard used by the user to generate the message, and/or information about the operating system controlling the software used by the user to generate the message.
  • the message may be accompanied by data indicating the user used a French keyboard to generate the message and that user's operating system is in English.
  • one or more language detection methods are used (step 904) to detect a language in the message.
  • Each method used by the detection method module 16 may output a prediction regarding the language present in the message.
  • the prediction may be in the form of a vector that includes a probability for each possible language that may be in the message.
  • the output from the detection method module 16 is then delivered to the classifier module 18 where the results from two or more language detection methods may be combined (step 906).
  • Various combinations of the results from the language detection methods may be obtained.
  • the results from the byte n-gram method and the dictionary based method are combined in the classifier module 18 by interpolation.
  • a SVM combination or classification is performed on the results from the byte n-gram method, the dictionary-based method, the alphabet method, and the user profile method.
  • the combination may include or consider results from the script-based method.
  • a further example includes a large linear combination of the byte n-gram method, the language profile method, and the dictionary method. In general, however, the results from any two or more of the language detection methods may be combined in the classifier module 18.
  • the method 900 uses the manager module 20 to select output (step 908) from a particular classifier.
  • the output may be selected based on, for example, a confidence score computed by a classifier, an expected language detection accuracy, and/or a linguistic domain for the message.
  • a best language is then chosen (step 910) from the selected classifier output.
  • a method 1000 includes receiving or providing a message (step 1002) that may include information about the keyboard language used to generate the message. If the message is greater than a threshold length (e.g., 25 bytes or 25 characters) (step 1004), the language may be detected (step 1006) using the byte n-gram method (or other method or combination of methods). The language of the message may then be chosen (step 1008), based on the results from the byte n-gram method. Otherwise, if the message is less than or equal to the threshold length, the system may determine if the keyboard language is available (step 1010).
  • a threshold length e.g. 25 bytes or 25 characters
  • the language of the message may be chosen (step 1012) to be the same as the keyboard language.
  • the method 1000 may again consider the length of the message. For example, if the message length is less than a second threshold (e.g., 4 bytes or 4 characters) (step 1014), the language may be detected (step 1016) and chosen using the dictionary-based method. Otherwise, if the message length is greater than the second threshold, the byte n-gram method (or other method or combination of methods) may be used (step 1018) to detect the language in the message.
  • the results from the byte n-gram method and the dictionary-based method may be combined (e.g., using an interpolator or other classifier), and the language of the message may be determined based on the combination (step 1020).
  • FIG. 1 1 is an example method 1 100 of identifying a language in a text message.
  • a text message that was generated on a client device of a user is received or provided (step 1102).
  • the alphabet-based method and/or the script-based method are used to determine (step 1 104) an alphabet and/or a script associated with the text message.
  • a candidate language associated with the alphabet and/or the script is identified. If the candidate language is a language with a unique alphabet and/or script (e.g., Russian, Arabic, Hebrew, Greek, Chinese, Taiwanese, Japanese, or Korean) (step 1106), then the candidate language is determined (step 1 108) to be the language of the text message.
  • a unique alphabet and/or script e.g., Russian, Arabic, Hebrew, Greek, Chinese, Taiwanese, Japanese, or Korean
  • the length of the text message is evaluated. If the message length is less than a threshold length (e.g., four bytes or four characters) and the text message includes or is accompanied by a keyboard language used by the client device (step 1 110), then the language of the message is chosen (step 11 12) to be the keyboard language. [0063] Alternatively, if the message length is greater than the threshold length or the keyboard language is not available, then the message is processed with an n-gram method (e.g., the byte n-gram method) to identify (step 11 14) a first set of possible languages for the text message.
  • a threshold length e.g., four bytes or four characters
  • the text message includes or is accompanied by a keyboard language used by the client device (step 1 110)
  • the language of the message is chosen (step 11 12) to be the keyboard language.
  • the message length is greater than the threshold length or the keyboard language is not available, then the message is processed with an n-gram method (e.g., the byte n-
  • the message is also then processed with the dictionary-based method to identify (step 1 116) a second set of possible languages for the text message. If a user language profile exists for the user (step 1 118), then the first set of possible languages, the second set of possible languages, and the user language profile 1120 are combined (e.g., using an SVM classifier or a large linear classifier) to obtain a first combination of possible languages (step 1 122). The language of the text message is then chosen (step 1 124), based on the first combination of possible languages. Otherwise, if the user language profile is not available, then the first set of possible languages and the second set of possible languages are combined (e.g., using a linear interpolator or other classifier) to obtain a second combination of possible languages (step 1 126). Finally, the language of the text message is chosen (step 1 128), based on the second combination of possible languages.
  • a user language profile exists for the user (step 1 118)
  • language detection is performed by combining the output from multiple language detection methods in two or more steps.
  • a first step may use the alphabet-script based method to detect special languages that use their own unique alphabets or scripts, such as Chinese (cn), Japanese (ja), Korean (ko), Russian (ru), Hebrew (he), Greek (el), and Arabic (ar).
  • the second step may use a combination (e.g., from a classifier) of multiple detection methods (e.g., the byte n-gram method, the user language profile based method, and the dictionary-based method) to detect other languages (e.g., Latin languages) in the message.
  • the message provided or received for language detection includes certain digits, characters, or images (e.g., emoticons or emojis) that are not specific to any particular language and/or are recognizable to any user, regardless of language preference.
  • the systems and methods described herein may ignore such characters or images when doing language detection and may ignore messages that include only such characters or images.
  • FIG. 12 is a flowchart of an example method 1200 for detecting a language in a message.
  • the method uses the detection method module 16, the classifier module 18, and the manager module 20 to identify a most likely or best language 1202 for a given input message 1204.
  • the input message 1204 may be accompanied by information about the user or the system(s) used to generate the message.
  • the input message 1204 may be accompanied by a user identification number (or other user identifier), information about the keyboard (e.g., a keyboard language) used to generate the message, and/or information about the operating system (e.g., an operating system language) used to generate the message.
  • the detection method module 16 includes ten different language detection methods.
  • Three of the language detection methods in the detection method module 16 are Byte n-gram A 1206, Byte n-gram B 1208, and Byte n-gram C 1210, which are all byte n-gram methods and may be configured to detect a different set or number of languages.
  • Byte n-gram A 1206 may be configured to detect 97 languages
  • Byte n-gram B 1208 may be configured to detect 27 languages
  • Byte n-gram C 1210 may be configured to detect 20 languages.
  • Two of the language detection methods in the detection method module 16 are Dictionary A 1212 and Dictionary B 1214, which are both dictionary- based methods and may be configured to detect a different set or number of languages.
  • Dictionary A 1212 may be configured to detect 9 languages
  • Dictionary B 1214 may be configured to detect 10 languages.
  • Two of the language detection methods in the detection method module 16 are Language Profile A 1216 and Language Profile B 1218, which are user language profile methods and may be configured to detect a different set or number of languages.
  • Language Profile A 1216 may be configured to detect 20 languages
  • Language Profile B 1218 may be configured to detect 27 languages.
  • Two of the language detection methods in the detection method module 16 are Alphabet A 1220 and Alphabet B 1222, which are alphabet-based methods and may be configured to detect a different set or number of languages.
  • Alphabet A 1220 may be configured to detect 20 languages
  • Alphabet B 1222 may be configured to detect 27 languages.
  • the detection method module 16 also includes a script-based language detection method 1224.
  • Output from the different language detection methods in the detection method module 16 is combined and processed by the classifier module 18.
  • an interpolation classifier 1226 combines output from Byte n-gram B 1208 and Dictionary B 1214. Weights for the interpolation may be, for example, 0.1 for Byte n-gram B 1208 and 0.9 for Dictionary B 1214.
  • the classifier module 18 may also use an SVM classifier 1228 that combines output from Byte n-gram C 1210, Dictionary B 1214, Language Profile B 1218, and Alphabet B 1222.
  • the classifier module 18 may also use a first combination 1230 of the script-based method 1224 and an SVM classifier combination of Byte n-gram C 1210, Dictionary A 1212, Language Profile A 1216, and Alphabet A 1220. Additionally, the classifier module 18 may use a second combination 1232 of the script based method 1224 and a Linear SVM classifier combination of Byte n-gram C 1210, Dictionary A 1212, and Language Profile A 1216. While FIG. 12 shows specific language detection tests, classifiers, and combinations of detection test output being used in the classifier module 18, other language detection tests, classifiers, and/or combinations may be used.
  • the script- based method 1224 and the classifier may be used in a tiered approach.
  • the script-based method 1224 may be used to quickly identify languages having unique scripts. When such a language is identified in the message 1204, use of the SVM classifier in the first combination 1230 or the Linear SVM classifier in the second combination may not be required.
  • the manager module 20 may select specific language detection methods, classifiers, and/or combinations of detection method output to identify the language in the message 1204.
  • the manager module 20 may make the selection according to the linguistic domain or according to an anticipated language for the message.
  • the manager module 20 may select specific classifiers according to a confidence score determined by the classifiers. For example, the manager module 20 may select the output from the classifier that is the most confident in its prediction.
  • the systems and methods described herein are suitable for making language detection available as a service to a plurality of users. Such a service is made possible and/or enhanced by the speed at which the systems and methods identify languages, and by the ability of the systems and methods to handle multiple identification techniques at runtime, based on service requests from diverse clients.
  • Embodiments of the subject matter and the operations described in this specification can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them.
  • Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on computer storage medium for execution by, or to control the operation of, data processing apparatus.
  • the program instructions can be encoded on an artificially generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus.
  • a computer storage medium can be, or be included in, a computer- readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of them. Moreover, while a computer storage medium is not a propagated signal, a computer storage medium can be a source or destination of computer program instructions encoded in an artificially-generated propagated signal. The computer storage medium can also be, or be included in, one or more separate physical components or media (e.g., multiple CDs, disks, or other storage devices).
  • the term "data processing apparatus” encompasses all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, a system on a chip, or multiple ones, or combinations, of the foregoing.
  • the apparatus can include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • the apparatus can also include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, a cross-platform runtime environment, a virtual machine, or a combination of one or more of them.
  • the apparatus and execution environment can realize various different computing model infrastructures, such as web services, distributed computing and grid computing infrastructures.
  • a computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment.
  • a computer program may, but need not, correspond to a file in a file system.
  • a program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code).
  • a computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
  • the processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform actions by operating on input data and generating output.
  • the processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • special purpose logic circuitry e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
  • processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer.
  • a processor will receive instructions and data from a read-only memory or a random access memory or both.
  • the essential elements of a computer are a processor for performing actions in accordance with instructions and one or more memory devices for storing instructions and data.
  • a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks.
  • mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks.
  • a computer need not have such devices.
  • a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive), to name just a few.
  • Devices suitable for storing computer program instructions and data include all forms of non- volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
  • the processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
  • embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer.
  • a display device e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor
  • keyboard and a pointing device e.g., a mouse or a trackball
  • Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.
  • a computer can interact with a user by sending documents to and receiving documents from a device that is used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.
  • a back-end component e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components.
  • the components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network.
  • communication networks include a local area network ("LAN”) and a wide area network (“WAN”), an inter- network (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks).
  • LAN local area network
  • WAN wide area network
  • inter- network e.g., the Internet
  • peer-to-peer networks e.g., ad hoc peer-to-peer networks.
  • the computing system can include clients and servers.
  • a client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
  • a server transmits data (e.g., an HTML page) to a client device (e.g., for purposes of displaying data to and receiving user input from a user interacting with the client device).
  • client device e.g., for purposes of displaying data to and receiving user input from a user interacting with the client device.
  • Data generated at the client device e.g., a result of the user interaction

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Machine Translation (AREA)
  • Document Processing Apparatus (AREA)

Abstract

Selon des modes de réalisation, la présente invention concerne un procédé, un système et un dispositif de stockage de programme informatique pour détecter une langue dans un message texte. Une pluralité de différents essais de détection de langue sont effectués sur un message associé à un utilisateur. Chaque essai de détection de langue détermine un ensemble de scores représentant une probabilité que le message est dans l'une des langues d'une pluralité de différentes langues. Une ou plusieurs combinaisons des ensembles de scores sont fournies sous la forme d'une entrée dans un ou plusieurs classificateurs distincts. Une sortie provenant de chacun des classificateurs comprend une indication respective selon laquelle le message est dans l'une des différentes langues. La langue dans le message peut être identifiée comme étant la langue indiquée par l'un des classificateurs, sur la base d'un score de confiance et/ou d'un domaine linguistique identifié.
EP14790972.5A 2014-10-17 2014-10-17 Système et procédé pour une détection de langue Withdrawn EP3207465A1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2014/061141 WO2016060687A1 (fr) 2014-10-17 2014-10-17 Système et procédé pour une détection de langue

Publications (1)

Publication Number Publication Date
EP3207465A1 true EP3207465A1 (fr) 2017-08-23

Family

ID=51842910

Family Applications (1)

Application Number Title Priority Date Filing Date
EP14790972.5A Withdrawn EP3207465A1 (fr) 2014-10-17 2014-10-17 Système et procédé pour une détection de langue

Country Status (6)

Country Link
EP (1) EP3207465A1 (fr)
JP (1) JP6553180B2 (fr)
CN (1) CN107111607B (fr)
AU (1) AU2014409115A1 (fr)
CA (1) CA2964331A1 (fr)
WO (1) WO2016060687A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2019535082A (ja) * 2016-10-03 2019-12-05 エム・ゼット・アイ・ピィ・ホールディングス・リミテッド・ライアビリティ・カンパニーMz Ip Holdings, Llc 言語検出のためのシステムおよび方法
CN107205089A (zh) * 2017-05-26 2017-09-26 广东欧珀移动通信有限公司 消息发送方法及相关产品
CN108009156B (zh) * 2017-12-27 2020-05-19 成都信息工程大学 一种基于部分监督学习的中文概括性文本切分方法
CN109934251B (zh) * 2018-12-27 2021-08-06 国家计算机网络与信息安全管理中心广东分中心 一种用于小语种文本识别的方法、识别系统及存储介质
US11475054B2 (en) 2020-04-24 2022-10-18 Roblox Corporation Language detection of user input text for online gaming
US11392768B2 (en) * 2020-05-07 2022-07-19 Servicenow, Inc. Hybrid language detection model

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6167369A (en) * 1998-12-23 2000-12-26 Xerox Company Automatic language identification using both N-gram and word information
US8849648B1 (en) * 2002-12-24 2014-09-30 At&T Intellectual Property Ii, L.P. System and method of extracting clauses for spoken language understanding
US8027832B2 (en) * 2005-02-11 2011-09-27 Microsoft Corporation Efficient language identification
JP2006302091A (ja) * 2005-04-22 2006-11-02 Konica Minolta Photo Imaging Inc 翻訳装置及びそのプログラム
US20060287848A1 (en) * 2005-06-20 2006-12-21 Microsoft Corporation Language classification with random feature clustering
US8185376B2 (en) * 2006-03-20 2012-05-22 Microsoft Corporation Identifying language origin of words
US8442965B2 (en) * 2006-04-19 2013-05-14 Google Inc. Query language identification
US7552045B2 (en) * 2006-12-18 2009-06-23 Nokia Corporation Method, apparatus and computer program product for providing flexible text based language identification
US8548797B2 (en) * 2008-10-30 2013-10-01 Yahoo! Inc. Short text language detection using geographic information
CN101645269A (zh) * 2008-12-30 2010-02-10 中国科学院声学研究所 一种语种识别系统及方法
US20110071817A1 (en) * 2009-09-24 2011-03-24 Vesa Siivola System and Method for Language Identification
JP5545467B2 (ja) * 2009-10-21 2014-07-09 独立行政法人情報通信研究機構 音声翻訳システム、制御装置、および情報処理方法
JP5672487B2 (ja) * 2010-11-11 2015-02-18 株式会社国際電気通信基礎技術研究所 音声言語識別装置の学習装置、音声言語の識別装置、及びそれらのためのプログラム
CN103314369B (zh) * 2010-12-17 2015-08-12 北京交通大学 机器翻译装置和方法
US8538742B2 (en) * 2011-05-20 2013-09-17 Google Inc. Feed translation for a social network
US8838437B1 (en) * 2011-06-30 2014-09-16 Google Inc. Language classifiers for language detection
US8832092B2 (en) * 2012-02-17 2014-09-09 Bottlenose, Inc. Natural language processing optimized for micro content
CN103077709B (zh) * 2012-12-28 2015-09-09 中国科学院声学研究所 一种基于共有鉴别性子空间映射的语种识别方法及装置
US9600473B2 (en) * 2013-02-08 2017-03-21 Machine Zone, Inc. Systems and methods for multi-user multi-lingual communications

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
None *
See also references of WO2016060687A1 *

Also Published As

Publication number Publication date
JP6553180B2 (ja) 2019-07-31
CN107111607A (zh) 2017-08-29
AU2014409115A1 (en) 2017-04-27
WO2016060687A1 (fr) 2016-04-21
JP2017532684A (ja) 2017-11-02
CA2964331A1 (fr) 2016-04-21
CN107111607B (zh) 2020-10-09

Similar Documents

Publication Publication Date Title
US9535896B2 (en) Systems and methods for language detection
US10699073B2 (en) Systems and methods for language detection
US20180329898A1 (en) Machine translation method for performing translation between languages
US20170185581A1 (en) Systems and methods for suggesting emoji
JP5475795B2 (ja) カスタム言語モデル
US9971763B2 (en) Named entity recognition
CN107111607B (zh) 用于语言检测的系统和方法
US20190087417A1 (en) System and method for translating chat messages
US8380488B1 (en) Identifying a property of a document
US9881010B1 (en) Suggestions based on document topics
JP5379138B2 (ja) 領域辞書の作成
CA3089001A1 (fr) Systeme et procede de traduction de langues
US11003993B1 (en) Training recurrent neural networks to generate sequences
US9251141B1 (en) Entity identification model training
CN111859940A (zh) 一种关键词提取方法、装置、电子设备及存储介质
CN111143564A (zh) 无监督的多目标篇章级情感分类模型训练方法和装置
Habib et al. An exploratory approach to find a novel metric based optimum language model for automatic bangla word prediction
EP3519984A1 (fr) Systèmes et procédés de détection de langue
US20190132274A1 (en) Techniques for ranking posts in community forums
Hemmer et al. Estimating Post-OCR Denoising Complexity on Numerical Texts
Kamath et al. Sarcasm detection approaches survey
JP2019215876A (ja) 言語検出を行うためのシステムおよび方法

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20170504

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAX Request for extension of the european patent (deleted)
RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: MZ IP HOLDINGS, LLC

17Q First examination report despatched

Effective date: 20200212

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20200825