Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Although this is subjective and argumentative, there is evidence that you can write a successful NLP project in python like <a href="http://code.google.com/p/nltk/" rel="nofollow noreferrer">NLTK</a>. They also have a <a href="http://nltk.googlecode.com/svn/trunk/doc/howto/nlp-python.html" rel="nofollow noreferrer">comparison of NLP functionality in different languages</a>: </p> <hr> <p>(Quoting from the comparison)</p> <p>Many programming languages have been used for NLP. As explained in the Preface, we have chosen Python because we believe it is well-suited to the special requirements of NLP. Here we present a brief survey of several programming languages, for the simple task of reading a text and printing the words that end with ing. We begin with the Python version, which we believe is readily interpretable, even by non Python programmers:</p> <pre><code>import sys for line in sys.stdin: for word in line.split(): if word.endswith('ing'): print word </code></pre> <p>[...]</p> <p>The C programming language is a highly-efficient low-level language that is popular for operating system and networking software:</p> <pre><code>#include &lt;stdio.h&gt; #include &lt;string.h&gt; int main(int argc, char **argv) { int i = 0; int c = 1; char buffer[1024]; while (c != EOF) { c = fgetc(stdin); if ( (c &gt;= '0' &amp;&amp; c &lt;= '9') || (c &gt;= 'a' &amp;&amp; c &lt;= 'z') || (c &gt;= 'A' &amp;&amp; c &lt;= 'Z') ) { buffer[i++] = (char) c; continue; } else { if (i &gt; 2 &amp;&amp; (strncmp(buffer+i-3, "ing", 3) == 0 || strncmp(buffer+i-3, "ING", 3) == 0 ) ) { buffer[i] = 0; puts(buffer); } i = 0; } } return 0; } </code></pre> <hr> <p>Edit: I didn't include comparable code in C++/Boost, so I add a code sample that does something similar, although not identical from the <a href="http://www.boost.org/doc/libs/1_42_0/libs/tokenizer/char_separator.htm" rel="nofollow noreferrer">Boost documentation</a>. Note that this isn't the cleanest version.</p> <pre><code>// char_sep_example_1.cpp #include &lt;iostream&gt; #include &lt;boost/tokenizer.hpp&gt; #include &lt;string&gt; int main() { std::string str = ";;Hello|world||-foo--bar;yow;baz|"; typedef boost::tokenizer&lt;boost::char_separator&lt;char&gt; &gt; tokenizer; boost::char_separator&lt;char&gt; sep("-;|"); tokenizer tokens(str, sep); for (tokenizer::iterator tok_iter = tokens.begin(); tok_iter != tokens.end(); ++tok_iter) std::cout &lt;&lt; "&lt;" &lt;&lt; *tok_iter &lt;&lt; "&gt; "; std::cout &lt;&lt; "\n"; return EXIT_SUCCESS; } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. PONLP project, python or C++
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USOtto Allmendinger
    1. USOtto Allmendinger
    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. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTDownMod
    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. CO+1 Above is directly applicable to the question and provides additional info.
      singulars
      1. PO
      1. USDana the Sane
    2. COthanks, it would be nice to know who -1ed me without comment though
      singulars
      1. PO
      1. USOtto Allmendinger
    3. COThe question is about python and C++/boost, this answer is about python and C. You can write a lot cleaner equivalent in C++ here
      singulars
      1. PO
      1. USf4.
 

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