Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-linguistics
Search options not deleted
user 1055
A branch of science that uses computers and mathematical methods to construct and investigate linguistic theory. Its technological and algorithmic implementation is called NLP.
2
votes
Similarity, Relatedness and Association
Synonymy means two words have the same meaning. An example would be words that are in the same WordNet synset. It should be noted that WordNet is word-sense disambiguated, meaning words with multiple …
- 2,908
7
votes
Is there a way to prove one language is more efficient than another language for science?
The OP is making a very common mistake when it comes to comparing languages. If you can find a copy of Language Myths by Laurie Bauer and Peter Trudgill, I suggest you read Myth #2: Some Languages Ju …
- 2,908
2
votes
Dictionaries for machine translation
The big name in computer-based dictionaries is WordNet which groups English lexical items by concept (called synsets). I can be downloaded and used offline. Obviously, this tool is quite powerful and …
- 2,908
4
votes
Studying Linguistics for a Programmer
If you are still a student (or if there is a university in your city), I suggest emailing or making an appointment to talk to some professors specializing in AI. Preferably ones specializing in Natura …
- 2,908
3
votes
Accepted
Common English bigrams / trigrams - recognising that a jumble of letters contain only valid ...
Note: I am a little confused on exactly what the OP means by "similar" and if they want to find English-like strings or actual English strings. I may need to edit my response once they provide clarifi …
- 2,908
1
vote
Can parsing be classified to some complexity class (e.g. NP-complete)?
While I have been unable to find any excerpts from the book in question, "A Fundamental Algorithm for Dependency Parsing" by M. Covington references "Computational Complexity And Natural Language" by …
- 2,908
4
votes
sentiment analytics
Sentiment Classification is a still developing field so I don't feel comfortable saying that there is a right or a wrong way to approach your problem. Your approach would theoretically work but it is …
- 2,908
1
vote
Corpora for extractive summaries
A list of extractive summary corpora can be found over on ResearchGate.
Additionally, a quick search revealed multiple papers on supervised extractive summarization (for example, this one), using the …
- 2,908
2
votes
Accepted
Enumerating the possible Pinyin -> Hanzi transcriptions
There are a multitude of online pinyin to Hanzi converters as well as several pinyin-based IMEs that do what you want but not in a way that you can include them in your own program.
Over on the Chine …
- 2,908