About and Around the French Enconverter and the French Deconverter
Etienne Blanc · Research in Computing Science · 2005
We briefly describe the French Enconverter and the French Deconverter. We discuss then a few general points concerning the possibility of designing dependency trees equivalent to UNL graphs, the treatment of the ambiguity and anaphora resolution, and the structure of the compound nodes.