| TextQuest - word permutations |
A list of word permutation is a list of all combiation of characters strings in a two-word sequence within a text unit. Each string is combined with each following string within the text unit.
Example:
This is a test
The combinations are:
This is
is a
a test
is a
is test
a test
These two-word-combinations are sorted by alphabet and counted like word sequences, they serve as tools for the building of categories, especially for the definition of word co-occurences.
Also the available options are identical with the ones of a word list.
last change of this page: May 23, 2007