https://doi.org/
Slides
NOT PEER REVIEWED
Download
metrics
VIEWS
232
 
downloads
7
CITE
How to cite these slides:
Moalla Z, Soualmia LF, Prieur-Gaston E et al. Spell-checking queries by combining Levenshtein and Stoilos distances. F1000Posters 2011, 2:1697 (slides)

Spell-checking queries by combining Levenshtein and Stoilos distances

Zied Moalla, Lina F Soualmia, Elise Prieur-Gaston, Thierry Lecroq1, Thierry Lecroq2, Stéfan J Darmoni
Published 27 Oct 2011
Author Affiliations
  • Metrics
  • 232 Views
  • 7 Downloads
Browse by related subjects
Published 27 Oct 2011

Spell-checking queries by combining Levenshtein and Stoilos distances

[version 1; not peer reviewed]

Zied Moalla, Lina F Soualmia, Elise Prieur-Gaston, Thierry Lecroq1, Thierry Lecroq2, Stéfan J Darmoni
Author Affiliations
1 CISMeF, Rouen University Hospital, France
2 TIBS, LITIS EA 4108, University of Rouen, France
Presented at
Network Tools and Applications in Biology Clinical Bioinformatics (NETTAB) Workshop 2011
Abstract
Gates Foundation grant number
PlaIR
Competing Interests

No competing interests were disclosed

Comments
0 Comments
 
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.