1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
<?xml version="1.0" encoding="ISO-8859-1"?>
<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.1.2//EN"
"http://www.oasis-open.org/docbook/xml/4.1.2/docbookx.dtd">
<!-- lifted from troff+man by doclifter -->
<refentry id='letterize.1'>
<refmeta>
<refentrytitle>letterize</refentrytitle>
<manvolnum>1</manvolnum>
<refmiscinfo class='date'>October 24, 1994</refmiscinfo>
<refmiscinfo class='productname'>letterize</refmiscinfo>
<refmiscinfo class='source'>letterize</refmiscinfo>
<refmiscinfo class='manual'>Miscellanea</refmiscinfo>
</refmeta>
<refnamediv id='name'>
<refname>letterize </refname>
<refpurpose> phone-number to letter-mnemonic generator</refpurpose>
</refnamediv>
<refsynopsisdiv id='synopsis'>
<cmdsynopsis>
<command>letterize</command> <arg choice='plain'><replaceable>nnnnnnn</replaceable></arg>
</cmdsynopsis>
</refsynopsisdiv>
<!-- body begins here -->
<refsect1 id='description'><title>DESCRIPTION</title>
<para>This program tries to help you find a letter mnemonic matching a
given phone number.</para>
<para>It emits to standard output each possible pronounceable mnemonic, one
per line, using the American standard mapping of dial letters to
numbers (2 goes to ABC, 3 to DEF, 4 to GHI, 5 to JKL, 6 to MNO, 7 to
PRS, 8 to TUV, 9 to XYZ).</para>
<para>The program uses a table of pronounceable letter-triples derived from
a dictionary scan. Each potential mnemonic must be such that all of
its letter-triples are in the table to be emitted. About 30% of
possible triples are considered pronounceable.</para>
<para>A typical 7-digit phone number has 19,683 possible mnemonics, but this
test usually cuts the list down to a few hundred or so, a reasonable
number to eyeball-check. For some numbers, the list will, sadly, be
empty.</para>
<para>It's best to leave out punctuation such as dashes and parens.</para>
</refsect1>
<refsect1 id='bugs'><title>BUGS</title>
<para>The filtering method doesn't know what plausible medial triples are
not reasonable at the beginnings and ends of words.</para>
<para>I'm not sure what table position 0 (which is what 0 and 1 are mapped
to) means. If you figure it out, you tell me. I really should have
generated my own table, but that would have been more work than this
seemed worth -- if your number contains either, you probably need
to generate your mnemonic in disjoint pieces around the digits anyway.</para>
</refsect1>
<refsect1 id='author'><title>AUTHOR</title>
<para>Eric S. Raymond <email>esr@snark.thyrsus.com</email>. It's
based on a table of plausible letter-triples that had no name attached
to it. Surf to <ulink
url='http://www.catb.org/~esr/'>http://www.catb.org/~esr/</ulink>
for updates and related resources.</para>
</refsect1>
</refentry>
|
