Given a dictionary of 4-letter words that have no repeated characters (from this list of words), you must choose ONE of those words, and output that specific word using the following dictionary of block letters:

 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| |      __      | || |   ______     | || |     ______   | || |  ________    | |
| |     /  \     | || |  |_   _ \    | || |   .' ___  |  | || | |_   ___ '.  | |
| |    / /\ \    | || |    | |_) |   | || |  / .'   \_|  | || |   | |   '. \ | |
| |   / ____ \   | || |    |  __'.   | || |  | |         | || |   | |    | | | |
| | _/ /    \ \_ | || |   _| |__) |  | || |  \ '.___.'\  | || |  _| |___.' / | |
| ||____|  |____|| || |  |_______/   | || |   '._____.'  | || | |________.'  | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| |  _________   | || |  _________   | || |    ______    | || |  ____  ____  | |
| | |_   ___  |  | || | |_   ___  |  | || |  .' ___  |   | || | |_   ||   _| | |
| |   | |_  \_|  | || |   | |_  \_|  | || | / .'   \_|   | || |   | |__| |   | |
| |   |  _|  _   | || |   |  _|      | || | | |    ____  | || |   |  __  |   | |
| |  _| |___/ |  | || |  _| |_       | || | \ '.___]  _| | || |  _| |  | |_  | |
| | |_________|  | || | |_____|      | || |  '._____.'   | || | |____||____| | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| |     _____    | || |     _____    | || |  ___  ____   | || |   _____      | |
| |    |_   _|   | || |    |_   _|   | || | |_  ||_  _|  | || |  |_   _|     | |
| |      | |     | || |      | |     | || |   | |_/ /    | || |    | |       | |
| |      | |     | || |   _  | |     | || |   |  __'.    | || |    | |   _   | |
| |     _| |_    | || |  | |_' |     | || |  _| |  \ \_  | || |   _| |__/ |  | |
| |    |_____|   | || |  '.___.'     | || | |____||____| | || |  |________|  | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .-----------------. .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| | ____    ____ | || | ____  _____  | || |     ____     | || |   ______     | |
| ||_   \  /   _|| || ||_   \|_   _| | || |   .'    '.   | || |  |_   __ \   | |
| |  |   \/   |  | || |  |   \ | |   | || |  /  .--.  \  | || |    | |__) |  | |
| |  | |\  /| |  | || |  | |\ \| |   | || |  | |    | |  | || |    |  ___/   | |
| | _| |_\/_| |_ | || | _| |_\   |_  | || |  \  '--'  /  | || |   _| |_      | |
| ||_____||_____|| || ||_____|\____| | || |   '.____.'   | || |  |_____|     | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| |    ___       | || |  _______     | || |    _______   | || |  _________   | |
| |  .'   '.     | || | |_   __ \    | || |   /  ___  |  | || | |  _   _  |  | |
| | /  .-.  \    | || |   | |__) |   | || |  |  (__ \_|  | || | |_/ | | \_|  | |
| | | |   | |    | || |   |  __ /    | || |   '.___'-.   | || |     | |      | |
| | \  '-'  \_   | || |  _| |  \ \_  | || |  |'\____) |  | || |    _| |_     | |
| |  '.___.\__|  | || | |____| |___| | || |  |_______.'  | || |   |_____|    | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| | _____  _____ | || | ____   ____  | || | _____  _____ | || |  ____  ____  | |
| ||_   _||_   _|| || ||_  _| |_  _| | || ||_   _||_   _|| || | |_  _||_  _| | |
| |  | |    | |  | || |  \ \   / /   | || |  | | /\ | |  | || |   \ \  / /   | |
| |  | '    ' |  | || |   \ \ / /    | || |  | |/  \| |  | || |    > '' <    | |
| |   \ '--' /   | || |    \ ' /     | || |  |   /\   |  | || |  _/ /''\ \_  | |
| |    '.__.'    | || |     \_/      | || |  |__/  \__|  | || | |____||____| | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------' 
 .----------------.  .----------------.                                         
| .--------------. || .--------------. |                                        
| |  ____  ____  | || |   ________   | |                                        
| | |_  _||_  _| | || |  |  __   _|  | |                                        
| |   \ \  / /   | || |  |_/  / /    | |                                        
| |    \ \/ /    | || |     .'.' _   | |                                        
| |    _|  |_    | || |   _/ /__/ |  | |                                        
| |   |______|   | || |  |________|  | |                                        
| |              | || |              | |                                        
| '--------------' || '--------------' |                                        
 '----------------'  '----------------'

Depending on how old you are, you may have just been given an injection of nostalgia from these block-based letters. Then again, past a certain point, you may have the nostalgia from watching your kids spell these block-based words out on their own. First originating in 1693, alphabet blocks were a pretty common education piece of the nuclear family and beyond. We're going to recreate this nostalgia by spelling a word from this list of words.

In other words, this challenge is to pick four letters from the keyspace definition and render them "stacked" in an order specified by the dictionary. You'll notice the dictionary omits 4-letter words like moon as they repeat letters, and are basically cheat-words.

Here is the block structure itself with no character inside:

 .----------------. 
| .--------------. | # Tops are periods.
| |              | |
| |              | |
| |              | |
| |              | |
| |              | |
| |              | |
| |              | |
| '--------------' | # Bottoms are apostrophe's.
 '----------------'

Rules

Characters inside the blocks only use: |/\_'.]-><.
Numbers don't exist, nor do symbols; only the letters in the word list.
This is a kolmogorov-complexity problem after you've chosen your word, you must output each block exactly as shown.
You may output them in any format you want, vertical, horizontal, stacked in a square; however, it must read top-to-bottom, left-to-right. Also, each block must be displayed without being altered, in a coherent format. This is to give more freedom to save bytes and allow a diverse output structure, much like how it would be when playing with blocks.
The main competitive element of this challenge is both compression optimization and, like my other problem, also factors in your ability to problem solve given the leg-room of seemingly "aesthetic" choice.

Examples

 .----------------.  .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. || .--------------. |
| |  _________   | || |  ____  ____  | || |   ______     | || |  _________   | |
| | |  _   _  |  | || | |_  _||_  _| | || |  |_   __ \   | || | |_   ___  |  | |
| | |_/ | | \_|  | || |   \ \  / /   | || |    | |__) |  | || |   | |_  \_|  | |
| |     | |      | || |    \ \/ /    | || |    |  ___/   | || |   |  _|  _   | |
| |    _| |_     | || |    _|  |_    | || |   _| |_      | || |  _| |___/ |  | |
| |   |_____|    | || |   |______|   | || |  |_____|     | || | |_________|  | |
| |              | || |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'  '----------------'

Is the same validity as:

 .----------------. 
| .--------------. |
| |  _________   | |
| | |  _   _  |  | |
| | |_/ | | \_|  | |
| |     | |      | |
| |    _| |_     | |
| |   |_____|    | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |  ____  ____  | |
| | |_  _||_  _| | |
| |   \ \  / /   | |
| |    \ \/ /    | |
| |    _|  |_    | |
| |   |______|   | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |   ______     | |
| |  |_   __ \   | |
| |    | |__) |  | |
| |    |  ___/   | |
| |   _| |_      | |
| |  |_____|     | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |  _________   | |
| | |_   ___  |  | |
| |   | |_  \_|  | |
| |   |  _|  _   | |
| |  _| |___/ |  | |
| | |_________|  | |
| |              | |
| '--------------' |
 '----------------'

Which is just as valid as:

                     .----------------.                     
                    | .--------------. |                    
                    | |  _________   | |                    
                    | | |  _   _  |  | |                    
                    | | |_/ | | \_|  | |                    
                    | |     | |      | |                    
                    | |    _| |_     | |                    
                    | |   |_____|    | |                    
                    | |              | |                    
                    | '--------------' |                    
                     '----------------'                     
 .----------------.  .----------------.  .----------------. 
| .--------------. || .--------------. || .--------------. |
| |  ____  ____  | || |   ______     | || |  _________   | |
| | |_  _||_  _| | || |  |_   __ \   | || | |_   ___  |  | |
| |   \ \  / /   | || |    | |__) |  | || |   | |_  \_|  | |
| |    \ \/ /    | || |    |  ___/   | || |   |  _|  _   | |
| |    _|  |_    | || |   _| |_      | || |  _| |___/ |  | |
| |   |______|   | || |  |_____|     | || | |_________|  | |
| |              | || |              | || |              | |
| '--------------' || '--------------' || '--------------' |
 '----------------'  '----------------'  '----------------'

This also works:

 .----------------.  .----------------. 
| .--------------. || .--------------. |
| |  _________   | || |  ____  ____  | |
| | |  _   _  |  | || | |_  _||_  _| | |
| | |_/ | | \_|  | || |   \ \  / /   | |
| |     | |      | || |    \ \/ /    | |
| |    _| |_     | || |    _|  |_    | |
| |   |_____|    | || |   |______|   | |
| |              | || |              | |
| '--------------' || '--------------' |
 '----------------'  '----------------' 
 .----------------.  .----------------. 
| .--------------. || .--------------. |
| |   ______     | || |  _________   | |
| |  |_   __ \   | || | |_   ___  |  | |
| |    | |__) |  | || |   | |_  \_|  | |
| |    |  ___/   | || |   |  _|  _   | |
| |   _| |_      | || |  _| |___/ |  | |
| |  |_____|     | || | |_________|  | |
| |              | || |              | |
| '--------------' || '--------------' |
 '----------------'  '----------------'

Even stuff that seems like it would cost bytes for you to do:

    .----------------.  .----------------.        
   | .--------------. || .--------------. |       
   | |  _________   | || |  ____  ____  | |       
   | | |  _   _  |  | || | |_  _||_  _| | |       
   | | |_/ | | \_|  | || |   \ \  / /   | |       
   | |     | |      | || |    \ \/ /    | |       
   | |    _| |_     | || |    _|  |_    | |       
   | |   |_____|    | || |   |______|   | |       
   | |              | || |              | |       
   | '--------------' || '--------------' |       
    '----------------'  '----------------'        
           .----------------.  .----------------. 
          | .--------------. || .--------------. |
          | |   ______     | || |  _________   | |
          | |  |_   __ \   | || | |_   ___  |  | |
          | |    | |__) |  | || |   | |_  \_|  | |
          | |    |  ___/   | || |   |  _|  _   | |
          | |   _| |_      | || |  _| |___/ |  | |
          | |  |_____|     | || | |_________|  | |
          | |              | || |              | |
          | '--------------' || '--------------' |
           '----------------'  '----------------'

However you can stack the blocks to save yourself bytes is a winner in my book.

This is code-golf, lowest byte-count wins.

Magic Octopus Urn

Posted 2017-05-04T16:44:41.117

Reputation: 19 422

1I'm only 17 and those give me nostalgia. – Leaky Nun – 2017-05-04T16:47:03.020

Nice challenge! +1 – Arjun – 2017-05-04T16:52:06.043

I'm going to guess that the the most popular word will either be hide or waxy. – Neil – 2017-05-04T17:01:04.103

@Neil What is your "guess" based on? – Erik the Outgolfer – 2017-05-04T17:02:11.863

@EriktheOutgolfer It's based on the most symmetrical-looking letters. – Neil – 2017-05-04T17:03:42.607

@Neil I don't think any of the letters is symmetrical, although they seem like that (e.g. is ()() a palindrome?). – Erik the Outgolfer – 2017-05-04T17:04:42.157

That's why I said symmetrical looking - but I bet there are some esolangs out that that can reflect ( into ) etc. – Neil – 2017-05-04T17:07:58.507

I have added compress methods in my approach. Are these methods allowed? – Jörg Hülsermann – 2017-05-04T23:32:04.347

@Neil charcoal can do this :P – Magic Octopus Urn – 2017-05-05T17:56:31.023

@carusocomputing So it can! – Neil – 2017-05-05T19:18:41.740

The full list of words that charcoal can mirror seems to be: ahoy hoax mayo waxy wham whoa whom. It just remains to determine which letters are easiest to draw. – Neil – 2017-05-06T13:46:32.860

@carusocomputing AHOY there! – Neil – 2017-05-06T15:34:06.453

Answers

Charcoal, 180 164 162 159 158 155 bytes

→⁸↘.↓⁹← '←⁸↗→⁶↗'↑⁷← .←⁶↘Ｆ³Ｃ⁰¦¹¹↓↓↗²____↓←|_↓↓³↗↘_←|_____↑¹↗²↓↓²↖↙_Ｍ⁶↓↘_↘⁴↑↘_←|____↑¹→↖\_↓\_Ｍχ↓↗²← _↑¹ ____↓←|↙_↙²|_↓←|___↘Ｍ⁵↓_↘_→'↘.↓\|↙¹←'.__↗→¹↗'↖|←.-‖Ｍ←

Try it online! Edit: Saved 16 18 bytes by manually drawing the letters WAY; unfortunately X turns out to be too hard to draw, so it's still printed using a string literal. Saved a further 3 bytes by switching from WAXY to AHOY. Saved another byte by switching to MAYO because I can use the predefined χ variable for 10. Saved a further 3 bytes by repeating the copy of the border in a loop. Explanation:

→⁸↘.↓⁹← '←⁸↗    Draw the outer right half of a block
→⁶↗'↑⁷← .←⁶↘    Draw the inner right half of a block
Ｆ³Ｃ⁰¦¹¹         Make three copies of the right half of the block
↓↓              Move into position and draw an M right half
↗²____↓←|_↓↓³↗↘_←|_____↑¹↗²↓↓²↖↙_
Ｍ⁶↓             Move into position and draw an A right half
↘_↘⁴↑↘_←|____↑¹→↖\_↓\_
Ｍχ↓             Move into position and draw a Y right half
↗²← _↑¹ ____↓←|↙_↙²|_↓←|___↘
Ｍ⁵↓             Move into position and draw an O right half
_↘_→'↘.↓\|↙¹←'.__↗→¹↗'↖|←.-
‖Ｍ←             Reflect to the left

Full list of letter right halves:

A   ↘_↘⁴↑↘_←|____↑¹→↖\_↓\_              (22 bytes)
H   _↑¹←↑¹ ____↓←|_↓↓³↗↘_←|____↑¹→↑¹←↓_ (35 bytes)
M   ↗²____↓←|_↓↓³↗↘_←|_____↑¹↗²↓↓²↖↙_   (33 bytes)
O   _↘_→'↘.↓\|↙¹←'.__↗→¹↗'↖|←.-↘        (28 bytes)
W   ↘²↑↑²← _↑¹ _____↓←|_↓↓⁴↖←__↖²↘      (30 bytes)
X    ____¶|_  _|¶ / /¶' <¶'\ \_¶|____|¶ (35 bytes)
Y   ↗²← _↑¹ ____↓←|↙_↙²|_↓←|___↘        (28 bytes)

If O, W, X or Y is the last letter then the last byte can be removed. On the other hand, M, W and Y cost 2 bytes as a first letter or a byte as the letter after O; H costs a byte as a first letter. With the above byte counts, the following words are possible:

MAYO 155 bytes (43+33+22+28+28+2-1)
AHOY 156 bytes (43+22+35+28+28+1-1)
WAXY 159 bytes (43+30+22+35+28+2-1)
WHOA 160 bytes (43+30+35+28+22+2)
HOAX 163 bytes (43+35+28+22+35+1-1)
WHAM 165 bytes (43+30+35+22+33+2)
WHOM 171 bytes (43+30+35+28+33+2)

Neil

Posted 2017-05-04T16:44:41.117

Reputation: 95 035

I like how you calculated the alternatives too, seems like the Jelly submission may be able to use AHOY for less too? – Magic Octopus Urn – 2017-05-08T13:20:18.667

@carusocomputing In order to save bytes he can't use letters that need both sorts of slashes on the same side, and WHAM is the only word that fits. – Neil – 2017-05-08T18:38:54.630

It's actually the .s and 's of the O that are the real killers (I'd be compressing as a base 6 number instead of a base 4 one). – Jonathan Allan – 2017-05-08T18:53:27.023

@JonathanAllan Indeed, but the only other mirrorable letter, X, has its own share of problems too. – Neil – 2017-05-08T20:53:39.827

@Neil was this your first charcoal answer? – Magic Octopus Urn – 2017-05-16T21:09:32.577

@carusocomputing According to https://codegolf.stackexchange.com/search?tab=newest&q=user:17602+Charcoal it's my third Charcoal answer.

– Neil – 2017-05-16T21:31:18.073

PHP, 362 Bytes

MILK

$a="--------------";$b=977775;echo strtr("2222
1111
5 6886 5976_885576_7759___8675
507\8/7_|59807_|75907_|7855 08|08_|85
9|7\/7|85577975989875575_/ /885
95\8/955779759857_7557|8__'.885
5 _5_\/_5_ 597_5_88557_5__/ |859_9\ \_85
506|06|59806|759|66|855 |6||6| 5
$b$b$b$b
3333
4444",
["|_","| .$a. |"," .-$a-. ","| '$a' |"," '-$a-' ","| |",____,"   ","  ","| |  "]);

Try it online!

PHP, 258 Bytes Only compressed

echo gzinflate(base64_decode("pZI5DsUgDET7nMJdqsCFkHyROfxnHJaB6iu4iOFhjxfF0rNZMjtgF3aaDCesCsK8mlULDwbC+j0eBhtksgAN4xUEz8UsMwNTMLhDkicZjCgUiJugRX7JEaUdWj9Ikf40GUVzdKOCYIf4V9BXwTrxnVTQWaTkcMsO34l0hyS1Hyns8S1WXHZIG052GGDZYTPIDkcu5shqOvIHVgXv9V+6GfidXTsjPWE/"));

Try it online!

PHP, 323 Bytes Code above compress with use of eval

eval(gzinflate(base64_decode("VVBdawQhDHz3VwQRbOF2135EI8v9klrCXincW+F6j/nxneyWQkdxwswYg2k7x+kf4pou594AXj8/rl/0fb/dbw/xGQhPQGCqIpW4t6oizCCEu6pKbRy4tCFLU+MuBQRrJySpiBVREw7d2lia+fXWEZEuDTXrQou4z2jS/1xu6raJap7dZ1LWseDwQUD7JGA0QNeufdBQD5Zq2D5M9VmsVn+VrBo2cUiXY4UXILwC8RTeomk8RaM5bTMZSpqntE0z7WpOWz7U7Go+VAj4BIVKLtCvCn5/XH8A")));

Try it online!

Jörg Hülsermann

Posted 2017-05-04T16:44:41.117

Reputation: 13 026

I mean, I don't see why they wouldn't be valid. They're boring though. If you choose to use the shorter compression answers to save bytes please keep the one you worked out as well :). – Magic Octopus Urn – 2017-05-05T17:57:21.443

@carusocomputing I would say if they are not valid the challenge is more interesting. Otherwise it could end in only compressed solutions – Jörg Hülsermann – 2017-05-05T18:16:21.790

I don't want to limit too much, else languages that use non-built-in compression for ASCII challenges won't be able to compete. – Magic Octopus Urn – 2017-05-08T12:21:28.510

Jelly, 119 114 bytes

WHAM

“ƭHGE94=ẠĊỴI>ạȧⱮṅƇṾ'Ñɦȥ⁴7?6ụ\ĖḂẆṾƇṗyZḣ&c%~Œ’ṃ“ |\_”s7;€“| |”µṚ“\/”y;µ€s6U4¦
“ŒUỴ2,Ɠ’ṃ“|'-. ”s4µṪẋ7ṭµ€m€0s3ṚjÐ€¢Y€Y

Try it online!

How?

The general idea is to choose letters which have left-right symmetry with minimal character translation so as to (a) reduce the base in which the data may be encoded and (b) keep the "reflection" function small.

The letter H has left-right symmetry with no need for translation. The letters W and A also have left-right symmetry if the /s on the left become \s on the right. Unfortunately there are not four such letters (with the same sides having the same slopes of slashes).

Letters such as O introduce more characters, which increases the base needed for encryption making for a far larger number and hence more bytes.

M, however, only introduces the other slash - if the half rows for the M are stored in reverse and with the wrong slashes, the base is kept at four and a post-decryption, post-reflection reversal of just these rows puts everything right again (this is the U4¦ in Link 1). This also means the character translation only needs to cater for \ becoming / and not the other way around too (i.e. Ṛ“\/”y; rather than Ṛ“\/“/\”y;).

“...’ṃ“ |\_”s7;€“| |”µṚ“\/”y;µ€s6U4¦ - Link 1: middle rows of blocks: no arguments
“...’                                - base 250 number
     ṃ“ |\_”                         - convert to base 4 with digits [0-3]="_ |\"
            s7                       - split into sevens
                “| |”                - literal "| |"
              ;€                     - concatenate €ach
                     µ               - monadic chain separation (call that rhs)
                             µ€      - for each r in rhs:
                      Ṛ              -     reverse r
                       “\/”y         -     convert any '\'s to '/'s
                            ;        -     concatenate with r
                               s6    - split into sixes
                                   ¦ - apply to indexes...
                                  4  -   four (the M)
                                 U   -   upend

“ŒUỴ2,Ɠ’ṃ“|'-. ”s4µṪẋ7ṭµ€m€0s3ṚjÐ€¢Y€Y - Main link: no arguments
“ŒUỴ2,Ɠ’                               - base 250 number
        ṃ“ -|.'”                       - convert to base 5 with digits [0-4]="' -|."
                s4                     - split into fours
                  µ                    - monadic chain separation (call that lhs)
                       µ€              - for each l in lhs:
                   Ṫ                   -   tail l
                    ẋ7                 -   repeat (the tail) seven times
                      ṭ                -   tack to l
                         m€0           - reflect €ach
                            s3         - split into threes
                              Ṛ        - reverse
                                  ¢    - call last link (1) as a nilad
                               jÐ€     - join mapped over right
                                   Y€  - join each with newlines
                                     Y - join with newlines
                                       - implicit print

Jonathan Allan

Posted 2017-05-04T16:44:41.117

Reputation: 67 804

1Surely M's /s are the same way around as Ys? – Neil – 2017-05-08T18:37:12.937

Yep I must have missed that when looking for words :/ – Jonathan Allan – 2017-05-08T18:41:08.347

Javascript 433 416 characters

Yeah, it is not very impressive. But I put this much work in and I don't see any easy way to get a lot better :)

_=>{r=(s,x)=>s.repeat(x)

Z='| |'
q=(s,x)=>Z+r(_=' ',x)+s+r(_,14-s.length-x)+Z
h=r('-',14)
Y=(a,o)=>` .-${h}-. \n| .${h}. |
`+a.map((s,i)=>q(s,[2,1,3,3,2,1][i]+o)).join(N='\n')+N+q(r(_,14))+`
| '${h}' |
 '-${h}-' 
`
return Y([i=r(U='_',5),j='|_   _|',Z,Z+'    _',l='_| |___/ |',m=`|${i}____|`],1)+Y([i,j,Z,Z,I=U+Z+U,J=`|${i}|`],3)+Y([e=r(U,9),f='|_   ___  |',g=Z+'_  \\_|','|  _|',I,J],0)+Y([e,f,g,'|  _|  _',l,m],0)}

Not sure my letters are perfectly well formed:

 .----------------. 
| .--------------. |
| |   _____      | |
| |  |_   _|     | |
| |    | |       | |
| |    | |    _  | |
| |   _| |___/ | | |
| |  |_________| | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |     _____    | |
| |    |_   _|   | |
| |      | |     | |
| |      | |     | |
| |     _| |_    | |
| |    |_____|   | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |  _________   | |
| | |_   ___  |  | |
| |   | |_  \_|  | |
| |   |  _|      | |
| |  _| |_       | |
| | |_____|      | |
| |              | |
| '--------------' |
 '----------------' 
 .----------------. 
| .--------------. |
| |  _________   | |
| | |_   ___  |  | |
| |   | |_  \_|  | |
| |   |  _|  _   | |
| |  _| |___/ |  | |
| | |_________|  | |
| |              | |
| '--------------' |
 '----------------'

The result is saved to the a variable.

Steve Bennett

Posted 2017-05-04T16:44:41.117

Reputation: 1 558

Bubblegum, 119 bytes

00000000: d5d2 0106 0341 1483 6100 e614 3fb0 60a6  .....A..a...?.`.
00000010: 172a b948 0e5f 08d2 a754 a9d2 80f5 2df8  .*.H._...T....-.
00000020: bde1 ecb1 b33c f1e0 650c 4892 00c0 412c  .....<..e.H...A,
00000030: 406e cc27 bc46 3522 63e9 860b adac b017  @n.'.F5"c.......
00000040: bcf6 d32e bcda a2eb b3c8 ce34 c1ce 2c4c  ...........4..,L
00000050: d17b 4ce6 40a7 f1f7 91ca ea14 2994 e853  .{L.@.......)..S
00000060: 901f 770d ccc9 0b53 d858 85ff 1b29 66e4  ..w....S.X...)f.
00000070: 78ae d637 9feb 03                        x..7...

Try it online!

LIFE. Here is a list of all letters in a more readable format I used for trying out every single word.

ovs

Posted 2017-05-04T16:44:41.117

Reputation: 21 408

Great effort. Fortunately it still didn't beat Jelly. (???) (only 5 bytes) – user202729 – 2018-01-28T04:35:41.923

Wellp, only answer in 5 days is also 5 bytes from winning. +300 haha. – Magic Octopus Urn – 2018-01-29T13:52:15.167

Words with Blocks

Rules

Examples

Answers

Charcoal, 180 164 162 159 158 155 bytes

PHP, 362 Bytes

PHP, 258 Bytes Only compressed

PHP, 323 Bytes Code above compress with use of eval

Jelly, 119 114 bytes

WHAM

How?

Javascript 433 416 characters

Bubblegum, 119 bytes