Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version

Using Ternary DAGs for Spelling Correction

, 10 Jan 2009
A new data structure for spellchecking and spelling correction

Statistics


License

This article, along with any associated source code and files, is licensed under The zlib/libpng License

Share

About the Author

Peter Kankowski
Software Developer
Russian Federation Russian Federation
Peter lives in Siberia, the land of sleeping sun, beautiful mountains, and infinitely deep snow. He recently started a wiki about algorithms and code optimization, where people could share their ideas, learn, and teach others.

| Advertise | Privacy | Mobile
Web02 | 2.8.140814.1 | Last Updated 10 Jan 2009
Article Copyright 2008 by Peter Kankowski
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid