4199 search results - page 120 / 840 » Generalizing Data in Natural Language |
147
click to vote
ICFP
2010
ACM
15 years 6 months ago
2010
ACM
Existing macro systems force programmers to make a choice between clarity of specification and robustness. If they choose clarity, they must forgo validating significant parts of ...
164
click to vote
SIGIR
2004
ACM
15 years 10 months ago
2004
ACM
Capitalizing on the intuitive underlying assumptions of Language Modelling for Ad-Hoc Retrieval we present a novel approach that is capable of injecting the user’s context of th...
144
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
133
click to vote
COLING
2000
15 years 6 months ago
2000
Complex documents stored in a flat or partially marked up file format require layout sensitive preprocessing before any natural language processing can be carried out on their tex...
132
Voted
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...