Comments on: Word Cube

By: Jebb

Jebb — Sat, 31 Jul 2010 21:13:09 +0000

@ Gary: OK, looks like I’d completely misunderstood the assignment. I’m beginning to suspect regexes are not the right tool here…

By: Elvis Montero » Blog Archive » Fun with Word Cubes

Elvis Montero » Blog Archive » Fun with Word Cubes — Mon, 26 Jul 2010 13:42:43 +0000

[...] that finds all matching words for a given word cube. When you are finished, you are welcome to read or run a suggested solution, or to post your own solution or discuss the exercise in the comments [...]

By: Gary Johnson

Gary Johnson — Sun, 25 Jul 2010 22:58:37 +0000

@Jebb

The character set match ^[ncbcioune]+$ just validates that your dictionary word only consists of characters from the cube. However, like some of the other answers here, it doesn’t account for the distribution of these characters in the cube and the dictionary word. Therefore, your algorithm gives incorrect answers like “bobbin”, “innocence”, “niece”, and “onion”.

By: Jebb

Jebb — Sun, 25 Jul 2010 13:18:00 +0000

I'd appreciate any well-versed criticism of the regex I used: [sourcecode lang="python"] def cubewords(word_cube): import re center = word_cube[4] f = open('/usr/share/dict/words', 'r') str = f.read() f.close() pattern1 = "(?mi)(?=^\w{4,}$)(?=^[" + word_cube + "]+$)^\w*" + center + "\w*$" return re.findall(pattern1, str) [/sourcecode]

By: Programming Praxis – Word Cube » Perused

Programming Praxis – Word Cube » Perused — Tue, 20 Jul 2010 18:41:54 +0000

[...] is my first solution for a Programming Praxis assignment, the Word Cube [...]

By: Mac

Mac — Tue, 20 Jul 2010 12:04:09 +0000

Here’s a version in LUA:

http://pastebin.com/vBeDvup9

@matias: The python version misses the words with upper case characters.

By: Gary Johnson

Gary Johnson — Mon, 19 Jul 2010 20:09:45 +0000

;; My clojure solution.
;; The previous one forgets to compare the distribution
;; of characters between the words from the word list
;; and the characters from the word cube.

(ns wordcube
  (:use [clojure.contrib.duck-streams :only (read-lines)]))

(defn count-chars [chars] (apply merge-with + (for [char chars] {char 1})))

(defn solve [chars words-file]
  (let [middle-char #{(get chars 4)}
        char-counts (count-chars chars)]
    (filter #(and (> (count %) 3)
                  (some middle-char %)
                  (every? (fn [[char reps]] (<= reps (char-counts char 0))) (count-chars %)))
            (read-lines words-file))))

;; Usage
(solve "ncbcioune" "words.txt")

By: matías

matías — Mon, 19 Jul 2010 19:43:23 +0000

A bit of python:

def words_in_cube(cube):
return filter(lambda word: 3 < len(word) < 10 and \
cube[4] in word and
all(word.count(x) <= cube.count(x) for x in word),
(word.strip() for word in open('/usr/share/dict/words').xreadlines()))

By: karijes

karijes — Mon, 19 Jul 2010 16:17:46 +0000

Here is my attempt in clojure:

http://pastebin.com/gVf0DZV9

By: Remco Niemeijer

Remco Niemeijer — Tue, 13 Jul 2010 09:50:45 +0000

My Haskell solution (see http://bonsaicode.wordpress.com/2010/07/13/programming-praxis-word-cube/ for a version with comments):

import Data.Char
import Data.List

solve :: String -> [String] -> [String]
solve c = filter (\w -> length w > 3 && elem (c !! 4) w && null (w \\ c))

wordcube :: String -> IO ()
wordcube cube = mapM_ putStrLn . solve cube .
                lines . map toLower =<< readFile "words.txt"