681 search results - page 107 / 137 » Combining Theorem Proving with Natural Language Processing |
145
Voted
CICLING
2003
Springer
15 years 10 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
108
click to vote
AI
2007
Springer
15 years 11 months ago
2007
Springer
Complex Nominals (CNs) have simple syntactic structure that conceals non-trivial semantic characteristics. While speakers of natural languages combine noun(s)/adjective(s) with a h...
149
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
In this work, we attempt to tackle domain-transfer problem by combining old-domain labeled examples with new-domain unlabeled ones. The basic idea is to use old-domain-trained cla...
140
click to vote
ANSS
2006
IEEE
15 years 11 months ago
2006
IEEE
Selecting the right numerical solver or the most appropriate numerical package for a particular simulation problem it is increasingly difficult for users without an extensive math...
165
click to vote
COMSWARE
2006
IEEE
15 years 11 months ago
2006
IEEE
ing a middleware abstraction layer into wireless sensor networks is a widely accepted solution to facilitate application programming and allow network organization. In this paper,...