Apple Inc.

Bishal Barman

Jerome Rene Bellegarda

Douglas R Davidson

Brent D Ramerth

Vivek Kumar Rangarajan Sridhar

Systems and methods for analysis and validation of language models trained using data that is unavailable or inaccessible are provided. One example method includes, at an electronic device with one or more processors and memory, obtaining a first set of data corresponding to one or more tokens predicted based on one or more previous tokens. The method determines a probability that the first set of data corresponds to a prediction generated by a first language model trained using a user privacy preserving training process. In accordance with a determination that the probability is within a predetermined range, the method determines that the one or more tokens correspond to a prediction associated with the user privacy preserving training process and outputs a predicted token sequence including the one or more tokens and the one or more previous tokens.

Analysis and validation of language models

Systems and processes for operating an intelligent automated assistant are provided. In one example process a set of words including a grammatical error is received. The process can generate, using a neural network based on the set of words including the grammatical error and a reference set of words, a transformed set of words and further determine, based on the set of words including the grammatical error and the reference set of words, a reconstructed reference set of words. The process can also determine, based on a comparison of the transformed set of words and the reconstructed reference set of words, whether the transformed set of words is grammatically correct and provide an indication of whether the transformed set of words is grammatically correct to the neural network.

Automatic grammar detection and correction

The present disclosure generally relates to text correction and generating text correction models. In an example process for text correction, text input is received. In response to receiving the text input, a text string corresponding to the text input is displayed. The text string is represented by a token sequence. The process determines whether an end of the token sequence corresponds to a text boundary. In accordance with a determination that the end of the token sequence corresponds to a text boundary, the process determines, based on a context state of the token sequence, one or more textual errors at one or more tokens of the token sequence. An error indication for a portion of the text string corresponding to the one or more tokens is displayed.

Text correction

The present disclosure generally relates to systems and processes for emoji word sense disambiguation. In one example process, a word sequence is received. A word-level feature representation is determined for each word of the word sequence and a global semantic representation for the word sequence is determined. For a first word of the word sequence, an attention coefficient is determined based on a congruence between the word-level feature representation of the first word and the global semantic representation for the word sequence. The word-level feature representation of the first word is adjusted based on the attention coefficient. An emoji likelihood is determined based on the adjusted word-level feature representation of the first word. In accordance with the emoji likelihood satisfying one or more criteria, an emoji character corresponding to the first word is presented for display.

Emoji word sense disambiguation

Systems and processes for language identification from short strings are provided. In accordance with one example, a method includes, at a first electronic device with one or more processors and memory, receiving user input including an n-gram and determining a similarity between a representation of the n-gram and a representation of a first language. The representation of the first language is based on an occurrence of each of a plurality of n-grams in the first language and an occurrence of each of the plurality of n-grams in a second language. The method further includes determining whether the similarity between the representation of the n-gram and the representation of the first language satisfies a threshold.

Growing community of inventors

Cupertino, CA, United States of America

Bishal Barman