Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Build Agents and Models on One Platform
Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.
Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
Little application for autotesting your english irregular verbs knowledge... or whatever... Being developed for (my) personal use and programming practice, so don't have high expectations. Still, it can be helpful when you found out how it works.
Add words to VocabularyReminder's database for it to ask their meaning to you from time to time. It tries better-teaching their meaning by asking less successfully known words each time.
Wordkeeper is a tool which helps you to stay in touch with other vocabulary and languages by asking words from time to time, and learning remembrance success of user.
Outil d'aide à la lecture. Mesure de l'efficacité de lecture, vitesse de lecture, compréhension de lecture. Développement de la fluidité en lecture. Lecture fluide en groupes de mots, en phrases, en paragraphes.
A small collection of practical and revelant language teaching tools written in Java Swing. Currently, it involves a 4-question multiple choice task creation tool, a "sort into two categories" creation tool, and a memory game creation tool.
The Stemmer class transforms a word into its root form. The input word is provided from the add() methods. The stem() method will return the stem as will toString() after stem() has been
called). The clear() method will wipe the Stemmer buffer and allow a new word to be input.
This version extends Martin Porter's original stemming algorithm by allowing capital letters to exist in words. This version should also be plugged in wherever the old algorithm is used with
few...
Ultimate dictionary that not only holds words but teaches them as well
There are many dictionaries so making another one can look words up would be extremely useless. But what if a dictionary could even teach those words put into it?
What do you think?