Detail

LEXMAN

LEXMAN is a system for management and representation of a bilingual lexicon. It is based on two generalized suf?x trees, one for each represented language. The suf?x trees are built using the Ukkonen’s algorithm.

This prototype has several time efficient query functions over the lexicons, with coverage has the most important one. This coverage operation allows to determine, for a pair of multi-word expressions, which words are unknown, contributing to improve the lexicons and increase their knowledge.