681 search results - page 6 / 137 » Combining Theorem Proving with Natural Language Processing |
AISC
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
70
Voted
EMNLP
2010
14 years 7 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
ACL
1992
14 years 10 months ago
1992
This paper describes a natural language processing system reinforced by the use of association of words and concepts, implemented as a neural network. Combining an associative net...
JSYML
2006
14 years 9 months ago
2006
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
AUSAI
2006
Springer
14 years 11 months ago
2006
Springer
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it wa...