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

Implementing a std::map Replacement that Never Runs Out of Memory and Instructions on Producing an ARPA Compliant Language Model to Test the Implementation

, 14 Dec 2008
An article on improving STL containers to cache to disk in order to lift memory limitation issues.

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

Roy, Philippe
Software Developer (Senior)
Canada Canada
Philippe Roy was a key contributor throughout his 20+ years career with many high-profile companies such as Nuance Communications, IBM (ViaVoice and ProductManager), VoiceBox Technologies, just to name a few. He is creative and proficient in OO coding and design, knowledgeable about the intellectual-property world (he owns many patents), tri-lingual, and passionate about being part of a team that creates great solutions.
 
Oh yes, I almost forgot to mention, he has a special thing for speech recognition and natural language processing... The magic of first seeing a computer transform something as chaotic as sound and natural language into intelligible and useful output has never left him.

| Advertise | Privacy | Mobile
Web01 | 2.8.140721.1 | Last Updated 14 Dec 2008
Article Copyright 2008 by Roy, Philippe
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid