{"id":2688,"date":"1997-07-13T00:00:00","date_gmt":"1997-07-13T00:00:00","guid":{"rendered":"http:\/\/www.kith.org\/words\/1997\/07\/13\/backward\/"},"modified":"2023-12-28T22:48:02","modified_gmt":"2023-12-29T06:48:02","slug":"backward","status":"publish","type":"post","link":"https:\/\/www.kith.org\/words\/1997\/07\/13\/backward\/","title":{"rendered":"B: Draws Cab"},"content":{"rendered":"\r\n<p>There are plenty of words which turn into other words when spelled backward. (No, not when spelled \"backward,\" smart-aleck. When the order of the letters is reversed, okay?) \"Straw\" turns into \"warts,\" \"mart\" into \"tram,\" \"room\" into \"moor,\" \"reward\" into \"drawer.\" More unusual\u2014or at least less commonly discussed\u2014are words I call \"switchbacks\": words which turn into other words if you <em>change one letter<\/em> (to any other letter) and then reverse the order of the letters.<\/p>\r\n<p>For instance:<\/p>\r\n<ul>\r\n  <li>elf &lt;\u2014&gt; fly<\/li>\r\n  <li>bird &lt;\u2014&gt; drab<\/li>\r\n  <li>deal &lt;\u2014&gt; land<\/li>\r\n  <li>door &lt;\u2014&gt; road<\/li>\r\n  <li>flaw &lt;\u2014&gt; waif (or wolf)<\/li>\r\n  <li>liar &lt;\u2014&gt; rain<\/li>\r\n<\/ul><p>As with ordinary backward words, shorter switchbacks tend to be less interesting. It's fairly easy to find three-letter switchbacks, such as \"now\" (becoming \"wow\" or \"wen\") and \"tea\" (becoming \"art\")\u2014you're changing one-third of the letters as you do the reversal. But four-letter switchbacks (\"work\" or \"word\" becoming \"prow\") are a little harder to find, and five-letter ones (or longer) are even harder. Here are a few:<\/p>\r\n<ul>\r\n  <li>adobe &lt;\u2014&gt; ebola<\/li>\r\n  <li>deter &lt;\u2014&gt; rated<\/li>\r\n  <li>dwarf &lt;\u2014&gt; fraud<\/li>\r\n  <li>lemon &lt;\u2014&gt; novel<\/li>\r\n  <li>lions &lt;\u2014&gt; snail<\/li>\r\n  <li>names &lt;\u2014&gt; semen<\/li>\r\n  <li>paper &lt;\u2014&gt; recap<\/li>\r\n<\/ul>\r\n<p>Note that the switchback process can never re-produce the original word. Changing <em>two<\/em> letters and reversing could take a near-palindromic word like \"never,\" change the first and last letters to make \"reven,\" and reverse to obtain the original word. But if you compare a word with its reversal, they always differ either in no letters (if the word is a palindrome) or in at least two letters; changing exactly one letter can never turn a word into its reverse.<\/p>\r\n<p>There's a word-ladder game that many logophiles enjoy (Lewis Carroll was a well-known practitioner), involving turning one word into another word by changing one letter at a time, with each intermediate step also being a word. For instance, you can bring home the bacon by changing WORK into MEAT one letter at a time: work, fork, folk, fold, mold, meld, melt, meat. (By the way, you can sometimes turn a word backward by changing one letter at a time\u2014you can change <a href=\"\/words\/answers\/backward-answers\/\">WARD into DRAW<\/a>, for instance, in eight steps...) You can make the same sorts of ladders with switchbacks: NAVES, for instance, to SEVEN, to NEVER, to RAVEN. I don't know of any switchback ladders longer than four steps, but I haven't looked very hard.<\/p>\r\n<p>My favorite switchback is the first one I came up with, back in high school: I noticed that if you turn \"flowered\" backwards and change one letter, you get \"werewolf.\" Who ever said <cite>Dungeons &amp; Dragons<\/cite>\u00ae wasn't educational?<\/p>\r\n<hr \/>\r\n<p>Addendum: I've written a <a href=\"https:\/\/www.kith.org\/words\/code\/switchback-finder\/\">Perl program<\/a> that takes a word as input and (by brute force) checks all switchback possibilities to see if they're words, by looking them up in a given word file (like the <i>\/usr\/dict\/words<\/i> file often found on UNIX systems). Note that this program is probably not the most efficient method of finding switchbacks, but it does seem to work. (Note particularly that if you run it on a system with other users, you probably ought to set it up to avoid hogging processor time, by using the <i>nice<\/i> utility or something.) Commentary and improvements are welcome. (One more note: I didn't use this program to find any of the above switchbacks.)<\/p>\r\n<hr \/>\r\n<p><cite>Dungeons &amp; Dragons<\/cite> is a registered trademark of TSR, Inc.<\/p>\r\n<hr \/>\r\n<p><a href=\"http:\/\/www.kith.org\/words\/1997\/07\/15\/backward-comments\/\">Reader comments page<\/a><\/p>\r\n\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":5,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[6,64],"tags":[],"class_list":["post-2688","post","type-post","status-publish","format-standard","hentry","category-2-uppercase-1","category-palindromes"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/posts\/2688","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/comments?post=2688"}],"version-history":[{"count":6,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/posts\/2688\/revisions"}],"predecessor-version":[{"id":18658,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/posts\/2688\/revisions\/18658"}],"wp:attachment":[{"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/media?parent=2688"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/categories?post=2688"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kith.org\/words\/wp-json\/wp\/v2\/tags?post=2688"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}