{"id":17427281,"url":"https://github.com/jdevlieghere/letter-matrix","last_synced_at":"2025-03-28T00:29:21.309Z","repository":{"id":27258598,"uuid":"30731052","full_name":"JDevlieghere/Letter-Matrix","owner":"JDevlieghere","description":"Word Search / Letter Matrix Solver in Haskell","archived":false,"fork":false,"pushed_at":"2015-02-27T15:22:14.000Z","size":320,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-02T02:26:16.477Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/JDevlieghere.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-02-12T23:34:45.000Z","updated_at":"2015-05-19T13:05:23.000Z","dependencies_parsed_at":"2022-09-01T02:11:48.392Z","dependency_job_id":null,"html_url":"https://github.com/JDevlieghere/Letter-Matrix","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JDevlieghere%2FLetter-Matrix","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JDevlieghere%2FLetter-Matrix/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JDevlieghere%2FLetter-Matrix/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/JDevlieghere%2FLetter-Matrix/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/JDevlieghere","download_url":"https://codeload.github.com/JDevlieghere/Letter-Matrix/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245948358,"owners_count":20698790,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-17T06:06:23.888Z","updated_at":"2025-03-28T00:29:21.289Z","avatar_url":"https://github.com/JDevlieghere.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Letter Matrix\n\nA **Word Search Game** or **Letter Matrix** solver written in about 20 lines of Haskell.\n\n## Compile \u0026 Run\n\nCompile with all optimizations.\n\n```shell\nghc -O2 --make Solver.hs\n```\n\nRun the solver with the dictionary and input file as command-line arguments.\n\n```shell\n./Solver dictionary/eng.dic example/example.txt +RTS -s\neuphemism\nicon\nconn\njuxtaposition\nposit\nposition\nclimax\nlima\nsarcasm\ncont\ntext\nambiguity\npate\ntemp\ntemple\ncacophony\nphony\nakin\nking\nconn\nnotation\nrios\ncatharsis\nthar\nnarrative\nattn\npalm\nperson\npersonification\nfica\ncation\nnotation\nsoliloquy\nlilo\nexpo\nexposition\nposit\nposition\nanecdote\ndote\nsynopsis\nthesis\n\n      54,873,456 bytes allocated in the heap\n      15,049,032 bytes copied during GC\n       4,290,352 bytes maximum residency (5 sample(s))\n         113,456 bytes maximum slop\n               9 MB total memory in use (0 MB lost due to fragmentation)\n\n                                    Tot time (elapsed)  Avg pause  Max pause\n  Gen  0       100 colls,     0 par    0.01s    0.01s     0.0001s    0.0003s\n  Gen  1         5 colls,     0 par    0.01s    0.01s     0.0020s    0.0054s\n\n  TASKS: 4 (1 bound, 3 peak workers (3 total), using -N1)\n\n  SPARKS: 0 (0 converted, 0 overflowed, 0 dud, 0 GC'd, 0 fizzled)\n\n  INIT    time    0.00s  (  0.00s elapsed)\n  MUT     time    0.05s  (  0.05s elapsed)\n  GC      time    0.02s  (  0.02s elapsed)\n  EXIT    time    0.00s  (  0.00s elapsed)\n  Total   time    0.07s  (  0.07s elapsed)\n\n  Alloc rate    1,107,056,226 bytes per MUT second\n\n  Productivity  74.2% of total user, 70.1% of total elapsed\n\ngc_alloc_block_sync: 0\nwhitehole_spin: 0\ngen[0].sync: 0\ngen[1].sync: 0\n```\n\n## Example\n\nThe example is taken from the [#wordsearchwednesday](https://medium.com/@Medium/wordsearchwednesday-a519722b5afd) post on Medium.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdevlieghere%2Fletter-matrix","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjdevlieghere%2Fletter-matrix","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjdevlieghere%2Fletter-matrix/lists"}