HUMAN-COMPUTER INTERACTION SECOND EDITION
Dix, Finlay, Abowd and Beale


Search Results


Search results for words
Showing 30 to 39 of 151 [<< prev] [next >>] [new search]


Chapter 2 The computer 2.6.3 Understanding speed and capacity Page 91

We think first of documents. This book is about 250,000 words, or about 1.5 Mbytes, so we could easily read it all into 16 Mbytes of RAM. To take a more popular work, the Bible would take about 4.5 Mbytes, using a considerable proportion of main memory, but easily fitting on disk. This makes the memory look not too bad, so long as you do not intend to put your entire library on-line. However, many word processors come with a dictionary and thesaurus, and there is no standard way to use the same one with several products. Together with help files and the program itself, it is not unusual to find each application consuming tens or even hundreds of megabytes of disk space -- it is not difficult to fill a gigabyte disk at all!


Chapter 2 The computer 2.6.4 Compression Page 92

In fact, things are not quite so bad, since compression techniques can be used to reduce the amount of storage required for text, bitmaps and video. All of these things are highly redundant. Consider text for a moment. In English, we know that if we use the letter 'q' then 'u' is almost bound to follow. At the level of words, some words like 'the' and 'and' appear frequently in text in general, and for any particular work one can find other common terms (this book mentions 'user' and 'computer' rather frequently). Similarly, in a bitmap, if one bit is white, there is a good chance the next will be as well. Compression algorithms take advantage of this redundancy. For example, Huffman encoding gives short codes to frequent words [118], and run-length encoding represents long runs of the same value by length value pairs. Text can easily be reduced by a factor of 5 and bitmaps often compress to 1% of their original size.


Chapter 2 The computer 2.6.5 Storage format and standards Page 93

RTF regards the document as formatted text, that is it concentrates on the appearance. Documents can also be regarded as structured objects: this book has chapters containing sections, subsections Š paragraphs, sentences, words and characters. There are OSI standards for document structure and interchange, which in theory could be used for transfer between packages and sites, but these are rarely used in practice. Just as the PostScript language is used to describe the printed page, Standard Generalized Markup Language (SGML) can be used to store structured text in a reasonably extensible way. You can define your own structures (the definition itself in SGML), and produce documents according to them.


Chapter 2 The computer 2.6.5 Storage format and standards Page 94

Given the range of storage standards (or rather lack of standards), there is no easy advice as to which is best, but if you are writing a new word processor and are about to decide how to store the document on disk, think, just for a moment, before defining yet another format.


Chapter 2 The computer 2.6.6 Methods of access Page 94

It is often said that dictionaries are only useful for people who can spell. Bad spellers do not know what a word looks like so cannot look it up to find out. Not only in spelling packages, but in general, an application can help the user by matching badly spelt versions of keywords. One example of this is do what I mean (DWIM) used in several of Xerox PARC's experimental programming environments. If a command name is misspelt the system prompts the user with a close correct name. Menu-based systems make this less of an issue, but one can easily imagine doing the same with, say, file selection. Another important instance of this principle is Soundex, a way of indexing words, especially names. Given a key, Soundex finds those words which sound similar. For example, given McCloud, it would find MacCleod. These are all examples of forgiving systems, and in general one should aim to accommodate the user's mistakes. Again, there are exceptions to this: you do not want a bank's automated teller machine (ATM) to give money when the PIN number is almost correct!


Chapter 2 The computer 2.6.6 Methods of access Page 95

Not all databases allow long passages of text to be stored in records, perhaps setting a maximum length for text strings, or demanding the length be fixed in advance. Where this is the case, the database seriously restricts interface applications where text forms an important part. At the other extreme, free text retrieval systems are centred on unformatted, unstructured text. These systems work by keeping an index of every word in every document, and so you can ask 'give me all documents with the words "human" and "computer" in them'. Programs, such as versions of the UNIX 'grep' command, give some of the same facilities by quickly scanning a list of files for a certain word, but are much slower.


Chapter 3 The interaction 3.2.3 The interaction framework Page 108

For example, while writing a paper with some word-processing package, it is necessary at times to see both the immediate surrounding text where one is currently composing, say, the current paragraph, and a wider context within the whole paper that cannot be easily displayed on one screen (for example, the current chapter).


Chapter 3 The interaction 3.5.1 Command line interface Page 116

The command line interface (Figure 3.7) was the first interactive dialog style to be commonly used and, in spite of the availability of menu-driven interfaces, it is still widely used. It provides a means of expressing instructions to the computer directly, using function keys, single characters, abbreviations or whole-word commands. In some systems the command line is the only way of communicating with the system, especially for remote access using telnet. More commonly today it is supplementary to menu-based interfaces, providing accelerated access to the system's functionality for experienced users.


Chapter 3 The interaction 3.5.3 Natural language Page 117

Perhaps the most attractive means of communicating with computers, at least at first glance, is by natural language. Users, unable to remember a command or lost in a hierarchy of menus, may long for the computer that is able to understand instructions expressed in everyday words! Natural language understanding, both of speech and written input, is the subject of much interest and research. Unfortunately, however, the ambiguity of natural language makes it very difficult for a machine to understand. Language is ambiguous at a number of levels. First, the syntax, or structure, of a phrase may not be clear. If we are given the sentence


Chapter 3 The interaction 3.5.3 Natural language Page 117

Even if a sentence's structure is clear, we may find ambiguity in the meaning of the words used. For example, the word 'pitch' may refer to a sports field, a throw, a waterproofing substance or even, colloquially, a territory. We often rely on the context and our general knowledge to sort out these ambiguities. This information is difficult to provide to the machine. To complicate matters more, the use of pronouns and relative terms adds further ambiguity.


Search results for words
Showing 30 to 39 of 151 [<< prev] [next >>] [new search]

processed in 0.006 seconds


feedback to feedback@hcibook.com hosted by hiraeth mixed media