Jump to content

Delimited search

From Wikipedia, the free encyclopedia

In computing, delimited search refers to a search user interface in which the user must type their query in full before initiating a search and receiving results. This is in contrast to incremental search, in which results are displayed to the user as they type their query.

Critique

[edit]

Interface design expert Jef Raskin critiqued delimited search (compared to incremental search) in his book The Humane Interface:

With a delimited search, the computer waits for the user to type a pattern and delimit it, after which it is the user who waits while the computer does the search. When using a delimited search the user must guess, beforehand, how much of a pattern the computer needs to distinguish the desired target from other, similar targets. With an incremental search, he can tell when he has typed enough to disambiguate the desired instance, because the target appeared on the display. (..) In spite of near agreement about the desirability of incremental searches on the part of both designers and users, almost all interface-building tools make it easy to implement delimited searches and difficult or impossible to implement incremental searches.[1]

References

[edit]
  1. ^ Raskin, Jef (2000-04-08). The Humane Interface. Addison-Wesley Professional. pp. 126. ISBN 978-0-201-37937-2. Read Text on Internet Archive
[edit]