Abstract: An online system provides group recommendations by applying a set of sourcing rules to identify a plurality of candidate groups and then generating scores for the candidate groups. The sourcing rules can be configured to identify a relatively small subset of the groups maintained by the online system. After the candidate groups are identified, the online system generates a score for each candidate group, ranks the candidate groups based on the scores, and sends high-ranking candidate groups to the target user to be displayed as recommended groups. As a result, the online system generates a smaller number of scores, which advantageously allows for the online system to provide group recommendations to users in a more computationally efficient manner.

Abstract: An online system provides group recommendations by applying a set of sourcing rules to identify a plurality of candidate groups and then generating scores for the candidate groups. The sourcing rules can be configured to identify a relatively small subset of the groups maintained by the online system. After the candidate groups are identified, the online system generates a score for each candidate group, ranks the candidate groups based on the scores, and sends high-ranking candidate groups to the target user to be displayed as recommended groups. As a result, the online system generates a smaller number of scores, which advantageously allows for the online system to provide group recommendations to users in a more computationally efficient manner.

Abstract: Embodiments of the present invention relate to a customizable text normalization framework providing for domain adaptability through modular replacement generators. In one embodiment, a method of and computer program product for text normalization are provided. An input sequence comprising a plurality of tokens is received. A plurality of generators is applied to the input sequence to generate a set of candidate replacements of the tokens of the sequence. A plurality of subsets of the set of candidate replacements is determined such that the candidate replacements of each subset are syntactically consistent. A probability is determined for each of the subsets. A subset of the plurality of subsets having the highest probability is selected. Each candidate replacement of the selected subset is applied to the input sequence to generate an output sequence. The output sequence is outputted.

Abstract: Embodiments of the present invention relate to a customizable text normalization framework providing for domain adaptability through modular replacement generators. In one embodiment, a method of and computer program product for text normalization are provided. An input sequence comprising a plurality of tokens is received. A plurality of generators is applied to the input sequence to generate a set of candidate replacements of the tokens of the sequence. A plurality of subsets of the set of candidate replacements is determined such that the candidate replacements of each subset are syntactically consistent. A probability is determined for each of the subsets. A subset of the plurality of subsets having the highest probability is selected. Each candidate replacement of the selected subset is applied to the input sequence to generate an output sequence. The output sequence is outputted.