Databases
StackOverflow2013
Postsdbo
PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
    primarykey
    data
    text
    <p>I have a list of all the words in the English dictionary (270,000+ words) stored in a variable called <code>theList</code>. I have a scrambled word <code>word</code> that I want to unscramble by matching against the word list. Initially, I thought that the following code would do the trick, but it doesn't work so well.</p> <pre><code>var theList; // Contains all the words in the English dictionary. var word = "iexospensr"; // The word I want to unscramble. var matches = word.match(new RegExp("^["+word+"]{"+word.length+"}$", "gim")); </code></pre> <p>I'd have expected "EXPRESSION" as the unscrambled result, but I instead get a lot more results (listed below).</p> <p><code>EERINESSES,EXPRESSERS,EXPRESSION,IRONNESSES,ISOSPORIES,NONPERSONS,NONPROSSES,NOSINESSES,OPENNESSES,OPPRESSION,OPPRESSORS,ORNERINESS,PENSIEROSO,PENSIONEER,PENSIONERS,PEPPERONIS,PERSIENNES,PERSONISES,PIPINESSES,PIXINESSES,POORNESSES,PORINESSES,POSSESSION,POSSESSORS,PREEXPOSES,PREPOSSESS,PREPPINESS,PRESENSION,PRIORESSES,PRISSINESS,PROPENSION,PROPERNESS,REINSPIRES,REPRESSERS,REPRESSION,REPRESSORS,RESERPINES,RESPONSERS,RESPONSORS,RIPENESSES,ROPINESSES,ROSINESSES,SERENENESS,SEXINESSES,SIXPENNIES,SNIPPINESS,SORENESSES,SPINNERIES</code></p> <p>Perhaps, if I could find a way to tell the regular expression to consider each letter in the string <code>word</code> just once irrespective of the order of the letters. So the end result would be an array of combination of those letters, and not permutations (what I have now).</p> <p>Any help would be appreciated.</p> <hr> <p>EDIT: I think the way to go would be: 1. finding all the combinations of the scrambled word 2. matching them against the word list to check for validity</p> <p>If you have a better solution (performance-wise), it'd help.</p> <hr> <p>The best solution to this problem seems to be reordering the anagram by alphabet, and the entire word list and matching the word against each item in the list.</p> <p>Here's the code:</p> <pre><code> var textList; // the entire dictionary var list = textList.match(/^.*$/gim); var sortedList = []; list.forEach(function(element, index, array) { sortedList[index] = element.split("").sort().join(""); }); function unscramble(word) { word = word.toUpperCase().split("").sort().join(""); var matches = []; for (var i = 0; i &lt; list.length; i++) { if (word.indexOf(sortedList[i]) &gt;= 0) { if (!matches[list[i].length]) matches[list[i].length] = []; matches[list[i].length].push(list[i]); } } return matches; } </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USHimanshu
    1. USHimanshu
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. This table or related slice is empty.
      1. VTUpMod
    1. COHow big are the words you wanto to scramble? How big are the strings they will be matched against? Will your regex be used once or many times?
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. UShugomg
    2. CO@missingno The words can be of variable length (2-15 characters). The string matched against contains all the words in the English dictionary, so that's around 270,000+ words.
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. USHimanshu
    3. COThe entire point of pre-sorting all the words is that you can have a hash that has "zero" lookup time instead of having to iterate through an array. I'm not sure what you're doing at the beginning there with the `.match(/^.*$/gim);`, but here's an example assuming you have your words in an array: http://jsfiddle.net/RYHAh/
      singulars
      1. PORegular Expression (Javascript) - Take a scrambled word and find an unscrambled match
      1. USMark Kahn
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload