home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: rec.humor
- Path: sparky!uunet!snorkelwacker.mit.edu!tamsun.tamu.edu!zeus.tamu.edu!shekhar
- From: shekhar@zeus.tamu.edu (SHARAT SHEKHAR)
- Subject: CONNECTED NAME SEQUENCES
- Message-ID: <17NOV199217351251@zeus.tamu.edu>
- News-Software: VAX/VMS VNEWS 1.41
- Sender: shekhar@zeus.tamu.edu (SHARATCHANDRA, M C)
- Organization: Texas A&M University, Academic Computing Services
- Date: Tue, 17 Nov 1992 23:35:00 GMT
- Lines: 35
-
-
- I've come up with the notion of "CONNECTED NAME SEQUENCES" for
- example consider :
- -------------- ------------
- "UMA THURMAN THOMAS PAYNE WEBBER" (Rank = 4)
- ----------- ------------
-
- Where the above is a sequence of rank 4 since its a sequence of 4
- names, Uma Thurman, Thurman Thomas, Thomas Payne & Payne Webber.
-
- The names can be either names of famous (or at least reasonably well-
- known ) persons, firms, things, products, objects, or places such that each
- component of the sequence is a 2 part entity that makes sense when expressed
- by itself.
-
-
- Another example of rank 5 is :
-
- --------- ------------ ----------
- Jim Eddie Murphy Brown Sugar Bowl (Rank = 5)
- ------------ -----------
-
- Note : Jim Eddie is the Defensive Coordinator of the Houston Oilers
- and while he's clearly not likely to make the Cover of "TIME",
- he's at least an example of the limit of obscurity thats
- permissible in the sequences.
-
- The idea is to get other netters to contribute more examples and to see
- who can come up with a sequence of the largest rank.
-
- If you feel that you need to explain who or what any/all of the
- components are, please do so.
-
-
- Adios for now - Sharat
-