Find pronounceable letter mnemonics for phone numbers
http://www.catb.org/~esr/letterize/
This 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. 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.
- Devel package for openSUSE:Factory
- Links to openSUSE:Factory / letterize
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout utilities/letterize && cd $_ - Create Badge
Refresh
Source Files (show merged sources derived from linked package)
| Filename | Size | Changed |
|---|---|---|
| _link | 0000000124 124 Bytes | |
| letterize-1.5.tar.gz | 0000007261 7.09 KB | |
| letterize.changes | 0000000159 159 Bytes | |
| letterize.spec | 0000001860 1.82 KB |
Comments 0