1548 search results - page 45 / 310 » Computational Approaches to Sentence Completion |
181
click to vote
ACL
1998
15 years 7 months ago
1998
Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that ...
158
click to vote
EUROGP
2007
Springer
16 years 13 days ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
169
click to vote
SEMWEB
2009
Springer
16 years 24 days ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
157
Voted
CAD
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
164
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...