Search Results for "form"

Scientific academic deciphering aiding tool, for ancient languages. The project was originally programmed on: 21/08/21 at 20:58. Currently in BETA, a state with a "Ugaritic cuneiform" feature for transliteration, form only at the moment. Others will be added soon. Supports: Windows & Linux. Runs in WINE for others.  

JapKatsuyou is a free open source application used for Japanese verb conjugation. * It is destined for Japanese language learners, in the hope that it will simplify conjugation task. * It can be used, also, to simplify making sentences for advanced learners, since it contains some complex forms.

Written in the Ada programming language, William Whitaker's Words Latin dictionary provides definitions and grammatical analysis of words found in Latin texts. It can deduce the dictionary form of a word based on the form actually found in a text. It can handle Latin words, phrases, or whole files. The dictionary contains some 39000 entries, as would be counted in an ordinary dictionary. This may generate many hundreds of thousands of 'words' that one can construct over all the declensions and conjugations. A few hundred prefixes and suffixes further enlarge the range. ...

OpenPoppy is an artificial intelligence program that will be ideally used by people wanting to practice their English language skills. it was created using c# and Microsoft visual studio. until recently OpenPoppy is a console based program and recognizes and responds to the user, enabling them to practice there English language skills. this is the next stage in the programs development. This form based AI developed in c# is a recreation of my previous console based application. development has now stoped on that project but can still be found at http://www.openpoppy.info and at https://sourceforge.net/projects/artificialintelligence/

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.