Changeable words: Difference between revisions
m changed wording in the task's preamble, added a workable URL. |
m added related tasks. |
||
Line 9: | Line 9: | ||
Note: '''changable''' can also be spelled '''changeable'''. |
Note: '''changable''' can also be spelled '''changeable'''. |
||
{{Template:Strings}} |
|||
<br><br> |
<br><br> |
||
__TOC__ |
__TOC__ |
Revision as of 05:30, 6 December 2020
- Task
Using the dictionary unixdict.txt, change one letter in a word, and if the changed word occurs in the dictionary,
then display the original word and the changed word here (on this page).
The length of any word shown should have a length > 11 .
Note: changable can also be spelled changeable.
- Metrics
- Counting
- Word frequency
- Letter frequency
- Jewels and stones
- I before E except after C
- Bioinformatics/base count
- Count occurrences of a substring
- Count how many vowels and consonants occur in a string
- Remove/replace
- XXXX redacted
- Conjugate a Latin verb
- Remove vowels from a string
- String interpolation (included)
- Strip block comments
- Strip comments from a string
- Strip a set of characters from a string
- Strip whitespace from a string -- top and tail
- Strip control codes and extended characters from a string
- Anagrams/Derangements/shuffling
- Word wheel
- ABC problem
- Sattolo cycle
- Knuth shuffle
- Ordered words
- Superpermutation minimisation
- Textonyms (using a phone text pad)
- Anagrams
- Anagrams/Deranged anagrams
- Permutations/Derangements
- Find/Search/Determine
- ABC words
- Odd words
- Word ladder
- Semordnilap
- Word search
- Wordiff (game)
- String matching
- Tea cup rim text
- Alternade words
- Changeable words
- State name puzzle
- String comparison
- Unique characters
- Unique characters in each string
- Extract file extension
- Levenshtein distance
- Palindrome detection
- Common list elements
- Longest common suffix
- Longest common prefix
- Compare a list of strings
- Longest common substring
- Find common directory path
- Words from neighbour ones
- Change e letters to i in words
- Non-continuous subsequences
- Longest common subsequence
- Longest palindromic substrings
- Longest increasing subsequence
- Words containing "the" substring
- Sum of the digits of n is substring of n
- Determine if a string is numeric
- Determine if a string is collapsible
- Determine if a string is squeezable
- Determine if a string has all unique characters
- Determine if a string has all the same characters
- Longest substrings without repeating characters
- Find words which contains all the vowels
- Find words which contain the most consonants
- Find words which contains more than 3 vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- Formatting
- Substring
- Rep-string
- Word wrap
- String case
- Align columns
- Literals/String
- Repeat a string
- Brace expansion
- Brace expansion using ranges
- Reverse a string
- Phrase reversals
- Comma quibbling
- Special characters
- String concatenation
- Substring/Top and tail
- Commatizing numbers
- Reverse words in a string
- Suffixation of decimal numbers
- Long literals, with continuations
- Numerical and alphabetical suffixes
- Abbreviations, easy
- Abbreviations, simple
- Abbreviations, automatic
- Song lyrics/poems/Mad Libs/phrases
- Mad Libs
- Magic 8-ball
- 99 bottles of beer
- The Name Game (a song)
- The Old lady swallowed a fly
- The Twelve Days of Christmas
- Tokenize
- Text between
- Tokenize a string
- Word break problem
- Tokenize a string with escaping
- Split a character string based on change of character
- Sequences
REXX
This REXX version doesn't care what order the words in the dictionary are in, nor does it care what
case (lower/upper/mixed) the words are in, the search for alternades is caseless.
It also allows the minimum length to be specified on the command line (CL) as well as the dictionary file identifier.
Programming note: the alphabet (used to changed any letter) is ordered by the highest frequency of use.
<lang rexx>/*REXX program finds changable words (within an identified dict.), changing any letter.*/
parse arg minL iFID . /*obtain optional arguments from the CL*/
if minL== | minL=="," then minL= 12 /*Not specified? Then use the default.*/
if iFID== | iFID=="," then iFID='unixdict.txt' /* " " " " " " */
@.= /*default value of any dictionary word.*/
do #=1 while lines(iFID)\==0 /*read each word in the file (word=X).*/ x= strip( linein( iFID) ) /*pick off a word from the input line. */ $.#= x; upper x; @.x= $.# /*save: original case. */ end /*#*/ /* [↑] semaphore name is uppercased. */
say copies('─', 30) # "words in the dictionary file: " iFID found= 0 /*count of the changable words found.*/ abc= 'etaoinshrdlcumwfgypbvkjxqz'; upper abc /*alphabet ordered by frequency of use.*/ Labc= length(abc) /*the length of the alphabet to be used*/
do j=1 for #-1; L= length($.j) /*process all the words that were found*/ if L<minL then iterate /*Is the word long enough? No, skip it*/ if \datatype($.j, 'M') then iterate /*verify that the word is all letters. */ x= $.j; upper x /*get an uppercased version of the word*/
do k=1 for L; _= substr(x, k, 1) /*y: the current letter being changed.*/ do c=1 for Labc /* [↓] change the _ letter to another.*/ ?= substr(abc, c, 1) /*get a new char to replace one in word*/ if ?==_ then iterate /*Is this the same char? Then use next*/ new= overlay(?, x, k) /*create a spanking new (changed) word.*/ newU= new; upper newU /*get an uppercase version of new word.*/ if @.newU== then iterate /*if the new word isn't a word, skip it*/ leave k /*we found a new word, stop searching.*/ end /*c*/ if k==L then iterate j /*No new word found? Then try another.*/ end /*k*/
found= found + 1 /*bump count of changable words found. */ say right(left($.j, 30), 40) @.newU /*indent original word for readability.*/ end /*j*/
say copies('─', 30) found ' changable words found with a minimum length of ' minL</lang>
- output when using the default inputs:
────────────────────────────── 25105 words in the dictionary file: unixdict.txt aristotelean aristotelian aristotelian aristotelean claustrophobia claustrophobic claustrophobic claustrophobia committeeman committeemen committeemen committeeman committeewoman committeewomen committeewomen committeewoman complementary complimentary complimentary complementary confirmation conformation conformation confirmation congresswoman congresswomen congresswomen congresswoman councilwoman councilwomen councilwomen councilwoman craftsperson draftsperson draftsperson craftsperson eavesdropped eavesdropper eavesdropper eavesdropped frontiersman frontiersmen frontiersmen frontiersman handicraftsman handicraftsmen handicraftsmen handicraftsman incommutable incomputable incomputable incommutable installation instillation instillation installation kaleidescope kaleidoscope kaleidoscope kaleidescope neuroanatomy neuroanotomy neuroanotomy neuroanatomy newspaperman newspapermen newspapermen newspaperman nonagenarian nonogenarian nonogenarian nonagenarian onomatopoeia onomatopoeic onomatopoeic onomatopoeia philanthrope philanthropy philanthropy philanthrope prescription proscription proscription prescription schizophrenia schizophrenic schizophrenic schizophrenia shakespearean shakespearian shakespearian shakespearean spectroscope spectroscopy spectroscopy spectroscope underclassman underclassmen underclassmen underclassman upperclassman upperclassmen upperclassmen upperclassman ────────────────────────────── 52 changable words found with a minimum length of 12
Ring
<lang ring> cStr = read("unixdict.txt") wordList = str2list(cStr) num = 0 oldWord = "abc"
ln = len(wordList) for n = ln to 1 step -1
if len(wordList[n]) < 12 del(wordList,n) ok
next
see "working..." + nl see "Changable words are:" + nl
for n = 1 to len(wordList)
len = len(wordList[n]) for m = 1 to len abcList = "abcdefghijklmnopqrstuvwxyz" for abc in abcList str1 = left(wordList[n],m-1) str2 = abc str3 = right(wordList[n],len-m) tempWord = str1 + str2 + str3 ind = find(wordList,tempWord) bool = (ind > 0) and (wordList[n][m] != abc) if bool = 1 and wordList[n] != oldWord num = num + 1 oldWord = tempWord see "" + num + ". " + wordList[n] + " >> " + tempWord + nl ok next next
next
see "done..." + nl </lang> Output:
working... Changable words are: 1. aristotelean >> aristotelian 2. claustrophobia >> claustrophobic 3. committeeman >> committeemen 4. committeewoman >> committeewomen 5. complementary >> complimentary 6. confirmation >> conformation 7. congresswoman >> congresswomen 8. councilwoman >> councilwomen 9. craftsperson >> draftsperson 10. eavesdropped >> eavesdropper 11. frontiersman >> frontiersmen 12. handicraftsman >> handicraftsmen 13. incommutable >> incomputable 14. installation >> instillation 15. kaleidescope >> kaleidoscope 16. neuroanatomy >> neuroanotomy 17. newspaperman >> newspapermen 18. nonagenarian >> nonogenarian 19. onomatopoeia >> onomatopoeic 20. philanthrope >> philanthropy 21. prescription >> proscription 22. schizophrenia >> schizophrenic 23. shakespearean >> shakespearian 24. spectroscope >> spectroscopy 25. underclassman >> underclassmen 26. upperclassman >> upperclassmen done...