Card sorting: Difference between revisions

Revision as of 12:50, 8 April 2010

Revision as of 15:11, 8 April 2010

Line 64:

See [[Tree testing (information architecture)|tree testing]].

In a ''reverse card sort'' or card-based classification, an existing structure of categories and sub-categories is tested. Users are given tasks and are asked to complete them navigating a structurecollection of cards. Each card contains the names of subcategories related subcategoriesto a category, and the user should find the card most relevant to the given task starting from the main card with the top-level categories. This ensures that the structure is evaluated in isolation, nullifying the effects of navigational aids, visual design, and other factors.

Reverse card sorting is ''evaluative''; it's used to judge whether a predetermined hierarchy provides a good way to find information.