Deriving word-commonness for word-games

Abstract

Word-commonness is identified for each word of a set of words of a language within a corpus of electronic documents. The set of words are sorted according to the word-commonness of each word relative to the other words of the set to obtain a sorted list. The sorted list defines an order of the words of the set that is based, at least in part, on the word-commonness of each word relative to the other words of the set.

1 . A method for a computing system, comprising:
 applying a computer program to a corpus of electronic documents to identify a word-commonness for each word of a set of words of a language within the corpus based, at least in part, on a frequency of that word within the corpus;   constructing a game interface having a plurality of word-game-object locations, each word-game-object location holding a word-game-object including a letter or a combination of two or more letters, and different combinations of adjacent word-game-objects forming puzzle-answer words from the set of words;   deploying the game interface to an electronic gaming environment for presentation;   receiving a player response from the electronic gaming environment indicating one or more puzzle-submission words; and   programmatically generating a results summary based, at least in part, on a comparison of the puzzle-submission words to the puzzle-answer words, the results summary indicating a more common subset of the puzzle-answer words having at least a threshold frequency within the corpus and a less common subset of the puzzle-answer words having less than the threshold frequency within the corpus.   
     
     
         2 . The method of  claim 1 ,
 wherein the more common subset of puzzle-answer words includes word-puzzle answers having at least the threshold frequency that are not present in the puzzle-submission words; and   wherein the less common subset of puzzle-answer words includes word-puzzle answers having less than the threshold frequency that are not present in the puzzle-submission words.   
     
     
         3 . The method of  claim 1 ,
 wherein the more common subset of puzzle-answer words includes word-puzzle answers having at least the threshold frequency that are present in the puzzle-submission words; and   wherein the less common subset of puzzle-answer words includes word-puzzle answers having less than the threshold frequency that are present in the puzzle-submission words.   
     
     
         4 . The method of  claim 1 , wherein the electronic gaming environment includes a client device from which the player response is received, and wherein the method further comprises deploying the results summary to the client device for presentation. 
     
     
         5 . The method of  claim 1 , further comprising:
 receiving a plurality of player responses from the electronic gaming environment, each player response indicating one or more puzzle-submission words identified by a different respective player; and   transferring a word of the set of words from the more common subset to the less common subset responsive to the word being indicated by less than a threshold number of the plurality of player responses, or   transferring the word of the set of words from the less common subset to the more common subset responsive to the word being indicated by more than a threshold number of the plurality of player responses.   
     
     
         6 . The method of  claim 1 , further comprising:
 applying the computer program to a different corpus of electronic documents to identify a word-commonness for each word of the set of words within the different corpus of electronic documents based, at least in part, on a frequency of that word within the different corpus; and   transferring a word of the set of words from one of the more common subset or the less common subset to the other of the more common subset or the less common subset based, at least in part, on the word-commonness for that word identified within the different corpus of electronic documents.   
     
     
         7 . The method of  claim 1 , further comprising:
 assigning a word-commonness score to each of the plurality of words, the word-commonness score having a number of values that are dependent on the frequency of that word within the corpus, with at least one score corresponding to the more common subset and at least one score corresponding to the less common subset.   
     
     
         8 . The method of  claim 1 , further comprising:
 for each letter of an alphabetic system of the language, identifying a letter-commonness of that letter within the corpus of electronic documents;   sorting the letters according to the letter-commonness of each letter relative to the other letters of the alphabetic system to obtain a sorted list of the letters.   
     
     
         9 . The method of  claim 8 , further comprising:
 for each letter of the alphabetic system, assigning a letter-commonness score to that letter which is representative of the letter-commonness of that letter relative to the letter-commonness of the other letters of the alphabetic system; and   outputting the sorted list of the letters with a respective letter-commonness score assigned to each of the letters of the alphabetic system.   
     
     
         10 . The method of  claim 9 , further comprising:
 for each of a plurality of empty game-object locations in the game interface, selecting a game-object from a pool of game-objects and loading that game-object into an empty game-object location;   wherein a representation of each letter of the alphabetic system within the pool of game-objects is based, at least in part, on the letter-commonness score assigned to that letter.   
     
     
         11 . A computing system, comprising:
 a server system configured to:   for each word of a set of words of a language, identify a word-commonness of that word within a corpus of electronic documents based, at least in part, on a frequency of that word within the corpus;   for each letter of an alphabetic system of the language, identify a letter-commonness of that letter within the corpus of electronic documents;   construct a game interface having a plurality of word-game-object locations, each word-game-object location holding a word-game-object including a letter or a combination of two or more letters of the alphabetic system selected from a pool of word-game-objects, a representation of each letter of the alphabetic system within the pool of word-game-objects based, at least in part, on the letter-commonness of that letter, the game interface having different combinations of adjacent word-game-objects forming puzzle-answer words from the set of words, the game interface having at least a threshold number of puzzle-answer words of a threshold word-commonness within the corpus;   deploy the game interface to an electronic gaming environment for presentation;   receiving a player response from the electronic gaming environment indicating one or more puzzle-submission words; and   programmatically generating a results summary based, at least in part, on a comparison of the puzzle-submission words to the puzzle-answer words, the results summary indicating a more common subset of the puzzle-answer words having at least a threshold frequency within the corpus that are not present in the puzzle-submission words and a less common subset of the puzzle-answer words having less than the threshold frequency within the corpus that are not present in the puzzle-submission words.   
     
     
         12 . A storage subsystem holding instructions executable by a logic subsystem to:
 receive a set of words of a language;   for each word of the set, identify a word-commonness of that word within a corpus of electronic documents;   sort the set of words according to the word-commonness of each word relative to the other words of the set to obtain a sorted list of the set of words; and   output the sorted list, the sorted list defining an order of the words of the set that is based, at least in part, on the word-commonness of each word relative to the other words of the set.   
     
     
         13 . The storage subsystem of  claim 12 , wherein the instructions are further executable by the logic subsystem to:
 for each word of the set, assign a word-commonness score to that word which is representative of the word-commonness of that word within the corpus of electronic documents; and   output the sorted list with a respective word-commonness score assigned to each word of the set.   
     
     
         14 . The storage subsystem of  claim 12 , wherein the set of words form a pool of puzzle answers;
 wherein the instructions are further executable by the logic subsystem to:   for each of a plurality of empty game-object locations in a game interface, load a game-object into that empty game-object location to construct a game interface that is fully loaded with game-objects that form a set of puzzle answers, the set of puzzle answers including at least a threshold number of less common words assigned a word-commonness score within a first range and at least a threshold number of more common words assigned a word-commonness score within a second range.   
     
     
         15 . The storage subsystem of  claim 12 , wherein the set of words form a pool of recommended words;
 wherein the instructions are further executable by the logic subsystem to output the sorted list of the recommended words as recommended completions of partially entered search terms.   
     
     
         16 . The storage subsystem of  claim 12 , wherein the set of words form a pool of recommended words;
 wherein the instructions are further executable by the logic subsystem to output the sorted list of the recommended words as recommended spellings of misspelled words.   
     
     
         17 . The storage subsystem of  claim 12 , wherein the instructions are further executable by the logic subsystem to:
 output the sorted list in a format readable by a word-game program to construct a game interface that includes at least a threshold number of less common words and at least a threshold number of more common words identified by the sorted list.   
     
     
         18 . The storage subsystem of  claim 12 , wherein the instructions are further executable by the logic subsystem to:
 for each letter of an alphabetic system of the language, identify a letter-commonness of that letter within the corpus of electronic documents;   sort the letters according to the letter-commonness of each letter relative to the other letters of the alphabetic system to obtain a sorted list of the letters.   
     
     
         19 . The storage subsystem of  claim 18 , wherein the instructions are further executable by the logic subsystem to:
 for each letter of the alphabetic system, assign a letter-commonness score to that letter which is representative of the letter-commonness of that letter relative to the letter-commonness of the other letters of the alphabetic system; and   output the sorted list of the letters with a respective letter-commonness score assigned to each of the letters of the alphabetic system.   
     
     
         20 . The storage subsystem of  claim 19 , wherein the instructions are further executable by the logic subsystem to:
 for each of a plurality of empty game-object locations in a game interface select a game-object from a pool of game-objects and load that game-object into an empty game-object location to construct a game interface that is fully loaded with game-objects;   wherein each game-object includes a letter of the alphabetic system; and   wherein a representation of each letter of the alphabetic system within the pool of game-objects is based, at least in part, on the letter-commonness score assigned to that letter.