5718 search results - page 404 / 1144 » Modeling Rule Precision |
174
click to vote
LREC
2010
15 years 8 months ago
2010
In previous work, we presented a preliminary study to identify paraphrases between technical and lay discourse types from medical corpora dedicated to the French language. In this...
197
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...
204
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
207
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract--DNA self-assembly is emerging as the most promising technique for nanoscale self-assembly as it uses the simple, yet precise rules of DNA binding to create macroscale ass...
157
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...