In the spirit of the What is a Word™/Phrase™ series started by JLee, a special brand of Phrase™ and Word™ puzzles.
If a word conforms to a special rule, I call it a Renowned Word™.
Use the examples below to find the rule.
$$ % set Title text. (spaces around the text ARE important; do not remove.) % increase Pad value only if your entries are longer than the title bar. % \def\Pad{\P{0.0}} \def\Title{\textbf{ Renowned }} % \def\S#1#2{\Space{#1}{20px}{#2px}}\def\P#1{\V{#1em}}\ \def\V#1{\S{#1}{9}} \def\T{\Title\textbf{Words }^™\Pad}\def\NT{\Pad\textbf{Not}\T\ }\displaystyle \smash{\lower{29px}\bbox[yellow]{\phantom{\rlap{rubio.2017.02.04}\S{6px}{0} \begin{array}{cc}\Pad\T&\NT\\\end{array}}}}\atop\def\V#1{\S{#1}{5}} \begin{array}{|c|c|}\hline\Pad\T&\NT\\\hline % \text{ land }&\text{ sea }\\ \hline \text{ con }&\text{ pro }\\ \hline \text{ Web }&\text{ World }\\ \hline \text{ At }&\text{ On }\\ \hline \text{ Kit }&\text{ Kat }\\ \hline \text{ Kind }&\text{ Hate }\\ \hline \text{ Try }&\text{ Do }\\ \hline \text{ ton }&\text{ gram }\\ \hline \text{ ham }&\text{ pork }\\ \hline \text{ fill }&\text{ empty }\\ \hline \text{ ark }&\text{ noah }\\ \hline \text{ bob }&\text{ name }\\ \hline \end{array}$$
| Renowned Word™ | Not Renowned Word™ |
|---|---|
| land | sea |
| con | pro |
| Web | World |
| At | On |
| Kit | Kat |
| Kind | Hate |
| Try | Do |
| ton | gram |
| ham | pork |
| fill | empty |
| ark | noah |
| bob | name |
Here is a CSV version:
Renowned Words™,Not Renowned Words™
land, sea
con, pro
Web, World
At, On
Kit, Kat
Kind, Hate
Try, Do
ton, gram
ham, pork
fill, empty
ark, noah
bob, name
The puzzle satisfies the series' inbuilt assumption, that each word can be tested for whether it is a Renowned Word™ without relying on the other words.
These are the only examples of Renowned Words™; I would say the chances of more existing is close to zero (for now).
What is the special rule these words conform to?
