Hi Örjan,

not a beginners's task, I'd say, and less a problem of
Word as a problem of logic. The best forum maybe
microsoft.public.word.vba.general, not because of
Word programming, but because of the linguistic expertise there.

First you would need an exhaustive list of all tags.
Which reveals a first problem, as unfortunately e.g. gender "<GEN>"
has different meanings, depending on the preceding language.
From that follows, that the data do not really fit into
a table, as they are not 2-dimensional.
Let's say the expression1 is equal "Abwinkelung".
Then there is English(expression1) and
possibly Spanish(expression1), but there is, too,
Gender(Spanish(expression1)), which makes it 3-dimensional.
For a 2-dimensional represention you would need a list of
all possible genders in all possible languages.
And "<USE>" maybe dependant of the gender of the language
of the expression...

Then there is the complication, that the records may contain
different numbers of fields. Pretty bad. Must be possible
to overcome, but would be very complicated, see below "recursion".

As a start, if you really want to go through that,
I'd fill up all records with all possible fields,
which would determine the number columns.
Difficult enough.

Very off topic, but a hobby of mine:

Otherwise, you'll run into problems with recursion
similar to the "travelling salesman" problem.
Theoretically solvable, but only if there is no time limit.
In that context, I've learned a new expression:
computation time in CPU-years.

Greetings from Bavaria, Germany

Helmut Weber, MVP
"red.sys" & chr(64) & "t-online.de"
Word XP, Win 98
http://word.mvps.org/