Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I might be slightly confused about what you need, but by borrowing from <a href="http://norvig.com/spell-correct.html" rel="noreferrer">this post</a> I belive I have some code that should be helpful.</p> <pre><code>&gt;&gt;&gt; alphabet = 'abcdefghijklmnopqrstuvwxyz' &gt;&gt;&gt; word = 'java' &gt;&gt;&gt; splits = [(word[:i], word[i:]) for i in range(len(word) + 1)] &gt;&gt;&gt; splits [('', 'java'), ('j', 'ava'), ('ja', 'va'), ('jav', 'a'), ('java', '')] &gt;&gt;&gt; replaces = [a + c + b[1:] for a, b in splits for c in alphabet if b] &gt;&gt;&gt; replaces ['aava', 'bava', 'cava', 'dava', 'eava', 'fava', 'gava', 'hava', 'iava', 'java', 'kava', 'lava', 'mava', 'nava', 'oava', 'pava', 'qava', 'rava', 'sava', 'tava', 'uava', 'vava', 'wav a', 'xava', 'yava', 'zava', 'java', 'jbva', 'jcva', 'jdva', 'jeva', 'jfva', 'jgva', 'jhva', 'jiva', 'jjva', 'jkva', 'jlva', 'jmva', 'jnva', 'jova', 'jpva', 'jqva', 'jrva', 'jsva', ' jtva', 'juva', 'jvva', 'jwva', 'jxva', 'jyva', 'jzva', 'jaaa', 'jaba', 'jaca', 'jada', 'jaea', 'jafa', 'jaga', 'jaha', 'jaia', 'jaja', 'jaka', 'jala', 'jama', 'jana', 'jaoa', 'japa' , 'jaqa', 'jara', 'jasa', 'jata', 'jaua', 'java', 'jawa', 'jaxa', 'jaya', 'jaza', 'java', 'javb', 'javc', 'javd', 'jave', 'javf', 'javg', 'javh', 'javi', 'javj', 'javk', 'javl', 'ja vm', 'javn', 'javo', 'javp', 'javq', 'javr', 'javs', 'javt', 'javu', 'javv', 'javw', 'javx', 'javy', 'javz'] </code></pre> <p>Once you have a list of all possible replaces, you can simply do</p> <pre><code>valid_words = [valid for valid in replaces if lookup(valid)] </code></pre> <p>Which should give you all words that can be formed by replacing 1 character in word. By placing this code in a separate method, you could take a word, obtain possible next words from that current word, and recurse over each of those words. For example:</p> <pre><code>alphabet = 'abcdefghijklmnopqrstuvwxyz' def next_word(word): splits = [(word[:i], word[i:]) for i in range(len(word) + 1)] replaces = [a + c + b[1:] for a, b in splits for c in alphabet if b] return [valid for valid in replaces if lookup(valid)] </code></pre> <p>Is this enough help? I think your code could really benefit by separating tasks into smaller chunks.</p>
    singulars
    1. This table or related slice is empty.
    1. POThe Alphabet and Recursion
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USNolen Royalty
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POThe Alphabet and Recursion
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COTechnically, your coding is doing the same mine does, i'm not quite sure how to get my program to call each individual word in the list.
      singulars
      1. PO
      1. USUnknown
    2. COSince I can't call changeling(replaces,"lose",steps). I've also tried: for words in replaces: changeling(words,target,steps-1)
      singulars
      1. PO
      1. USUnknown
    3. COThey might be technically doing the same thing, but your code is trying to do far too much at the same time. You need to break things down so that your goal for what to recur over is clear. That being said, what happens when you try to call changeling(word, target, steps-1) for each word in replaces? That is the correct track. Soon you will run into the question of whether to check all words at a certain level before checking any words at the next level (depth first vs breadth first searching).
      singulars
      1. PO
      1. USNolen Royalty
 

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