[Snowball-discuss] ANOTHER APPROACH

[Paltonio Daun Fraga]

Dear sirs, I saw your project snowball for a lot of human languages.

I propose you another approach, based on the project GETA (now GETALPS) from
Grenoble, France

This is based on RADICAL (bases) dictionnaires (ambiguous or non ambiguous)
with classifications like (regular, irregularities) those calling
subgrammars in a recursive way
and an AUTOMATA based on NON-DETERMINISTIC FINITE AUTOMATA (Hopcroft &
Ullmn)
Plus endings (prefixes or suffixes) for word decomposition (segmentation)
with morpho-syntactic information as (person, time/tense, number, and so on)

So you will have only one algorythm (ATEF at GETA, an other variants as
SYGMART at www.sygtext.fr of Jacques Chauché)

The GETA (Bernard Vauquois) model for Automatic Translation was based on
several levels of treatment
The lowest input is a Morpho-syntactic analyser based on this ATEF (or ANMOR
i programmed in FORTRAN)
the output is a complex tree (arborescence decorée) with morphologic,
syntactic and semantic traits to guide in ambiguity solving.

The next level is a Syntactic Analyser based on a tree-transducer (CETA then
ARBOR and lately ROBRA, a recursive tree pattern matcher and
transformation guided by recursive subgrammars quite equivalent to a Turing
Machine with reduced the risk for non-stop) The output is a tree structure
with the profound analysis of the text.
ROBRA is due to Christian Boitet by the 1970's.

The highest level is a transfer level that maps the structures and
LexicalUnities to another(s) language(s)
than a phrase synthetiser and a again a deterministic automata to recompose
the words in the output language model. called SYGMOR.

I will show you other details soon.
Attentiously, yours,

Paltonio Fraga
FFLCH-USP, São Paulo, BR
paltoniofraga at gmail.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.tartarus.org/mailman/private/snowball-discuss/attachments/20090817/1ff2cb82/attachment.htm