681 search results - page 94 / 137 » Combining Theorem Proving with Natural Language Processing |
IJCNLP
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
FUIN
2006
14 years 9 months ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
IJCNLP
2004
Springer
15 years 3 months ago
2004
Springer
The paper discusses two policies for recognizing NEs with complex structures by maximum entropy models. One policy is to develop cascaded MaxEnt models at different levels. The ot...
JMLR
2010
14 years 8 months ago
2010
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...
112
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...