{"id":24021094,"url":"https://github.com/zipcodecore/wordforword","last_synced_at":"2025-02-25T23:46:32.253Z","repository":{"id":222664208,"uuid":"758023919","full_name":"ZipCodeCore/WordForWord","owner":"ZipCodeCore","description":"a series of text processing methods","archived":false,"fork":false,"pushed_at":"2024-02-15T20:43:36.000Z","size":350,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-08T12:41:14.234Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/ZipCodeCore.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-02-15T13:26:53.000Z","updated_at":"2024-02-20T16:14:11.000Z","dependencies_parsed_at":"2024-02-15T15:26:24.031Z","dependency_job_id":"89328afc-e1dc-480e-86f3-b02e09d88bc4","html_url":"https://github.com/ZipCodeCore/WordForWord","commit_stats":null,"previous_names":["zipcodecore/wordforword"],"tags_count":0,"template":true,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FWordForWord","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FWordForWord/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FWordForWord/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ZipCodeCore%2FWordForWord/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ZipCodeCore","download_url":"https://codeload.github.com/ZipCodeCore/WordForWord/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240766672,"owners_count":19854114,"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":"2025-01-08T12:38:39.903Z","updated_at":"2025-02-25T23:46:32.213Z","avatar_url":"https://github.com/ZipCodeCore.png","language":"Java","readme":"# WordForWord\n\na series of text processing methods\n\nFor the sake of this lab, words are not and do not have punctuation.\n\nFour phases of text processing to do. Write a method for each one.\n\n`public void print()`\nWrite a method that reads the contents of a file, line by line, and creates a String object,\nmaking sure all the newlines are preserved. use BufferedReader to do the reading.\n\n`public WCResult wc(String input)`\ncommonly called \"wc\"; count the number of characters in a file, number of words, number of lines.\nReturns an object of class WCResult (a POJO) which consists of the three longs you counted.\n\n`public FrequencyMap wordFrequency(String input)`\nword count. words in a file, produce a map with (String word, Long numOfTimes). FrequencyMap returning a HashMap might be what you're\nlooking for here, or maybe something else.\n\n`public FrequencyMap letterFrequency(String input)`\nletter frequency, write a program that collects the frequency of each letter within the input.\n\nA `WCResult` is a class which contains the three Long number created when a text file is `wc`'d.\n\nA `FrequencyMap` is a class which is a POJO that contains a map of the things tracked as a key (a String in this case),\nand the number of times it appears in the input.\n\nInput like `The Blue Fox is blue.` would produce a map like\n\n| Word | Count |\n|------|-------|\n| the  | 1     |\n| blue | 2     |\n| fox  | 1     |\n| is   | 1     |\n\nThe class would also have a method `public double frequency(String word)` which returns the relative frequency of the \nword in the input text.\nSo `frequency(\"blue\")` would return 0.4 as a result.\nThis means you need to track the total number of words in the input, \nas frequency is `numberOfOccurences / totalNumberOfWords`\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fwordforword","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzipcodecore%2Fwordforword","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzipcodecore%2Fwordforword/lists"}