Count of unique words in multiple text files in a folder using awk in windows












0















I have multiple files in a folder (d:text).



Using gawk (in windows), I want to generate a list of words and their occurence count in the format below:





a 12145

the 22483

but 754


etc.






awk







share|improve this question


















  • 7





    Cool - what have you tried so far?

    – Mark Setchell
    Nov 15 '18 at 15:58
















0















I have multiple files in a folder (d:text).



Using gawk (in windows), I want to generate a list of words and their occurence count in the format below:





a 12145

the 22483

but 754


etc.






awk







share|improve this question


















  • 7





    Cool - what have you tried so far?

    – Mark Setchell
    Nov 15 '18 at 15:58














0












0








0








I have multiple files in a folder (d:text).



Using gawk (in windows), I want to generate a list of words and their occurence count in the format below:





a 12145

the 22483

but 754


etc.






awk







share|improve this question














I have multiple files in a folder (d:text).



Using gawk (in windows), I want to generate a list of words and their occurence count in the format below:





a 12145

the 22483

but 754


etc.






awk




awk






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Nov 15 '18 at 15:47









user1955215user1955215

3102616




3102616








  • 7





    Cool - what have you tried so far?

    – Mark Setchell
    Nov 15 '18 at 15:58














  • 7





    Cool - what have you tried so far?

    – Mark Setchell
    Nov 15 '18 at 15:58








7




7





Cool - what have you tried so far?

– Mark Setchell
Nov 15 '18 at 15:58





Cool - what have you tried so far?

– Mark Setchell
Nov 15 '18 at 15:58












1 Answer
1






active

oldest

votes


















0














Considering inputs:



$ ls ./in*

./in1.txt  ./in2.txt

$ cat in*

What's up Buddy. How are you doin Buddy?

What's up Man. I am happy and good and awesome.


AWK counting words with associative array, words treated as alpha characters (You will need to tune up and also create logic for upper/lower cases etc.). Note there is also added count 4 for empty string:



$ gawk 'BEGIN { RS="[^A-Za-z]"; } { words[$0]++; } END { for ( i in words ) print(i " " words[i]); }' ./in*

happy 1

are 1

 4

What 2

awesome 1

How 1

Buddy 2

and 2

I 1

up 2

good 1

doin 1

am 1

Man 1

you 1

s 2





share|improve this answer

























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53323075%2fcount-of-unique-words-in-multiple-text-files-in-a-folder-using-awk-in-windows%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    Considering inputs:



    $ ls ./in*
    
./in1.txt  ./in2.txt
    
$ cat in*
    
What's up Buddy. How are you doin Buddy?
    
What's up Man. I am happy and good and awesome.


    AWK counting words with associative array, words treated as alpha characters (You will need to tune up and also create logic for upper/lower cases etc.). Note there is also added count 4 for empty string:



    $ gawk 'BEGIN { RS="[^A-Za-z]"; } { words[$0]++; } END { for ( i in words ) print(i " " words[i]); }' ./in*
    
happy 1
    
are 1
    
 4
    
What 2
    
awesome 1
    
How 1
    
Buddy 2
    
and 2
    
I 1
    
up 2
    
good 1
    
doin 1
    
am 1
    
Man 1
    
you 1
    
s 2





    share|improve this answer






























      0














      Considering inputs:



      $ ls ./in*
      
./in1.txt  ./in2.txt
      
$ cat in*
      
What's up Buddy. How are you doin Buddy?
      
What's up Man. I am happy and good and awesome.


      AWK counting words with associative array, words treated as alpha characters (You will need to tune up and also create logic for upper/lower cases etc.). Note there is also added count 4 for empty string:



      $ gawk 'BEGIN { RS="[^A-Za-z]"; } { words[$0]++; } END { for ( i in words ) print(i " " words[i]); }' ./in*
      
happy 1
      
are 1
      
 4
      
What 2
      
awesome 1
      
How 1
      
Buddy 2
      
and 2
      
I 1
      
up 2
      
good 1
      
doin 1
      
am 1
      
Man 1
      
you 1
      
s 2





      share|improve this answer




























        0












        0








        0







        Considering inputs:



        $ ls ./in*
        
./in1.txt  ./in2.txt
        
$ cat in*
        
What's up Buddy. How are you doin Buddy?
        
What's up Man. I am happy and good and awesome.


        AWK counting words with associative array, words treated as alpha characters (You will need to tune up and also create logic for upper/lower cases etc.). Note there is also added count 4 for empty string:



        $ gawk 'BEGIN { RS="[^A-Za-z]"; } { words[$0]++; } END { for ( i in words ) print(i " " words[i]); }' ./in*
        
happy 1
        
are 1
        
 4
        
What 2
        
awesome 1
        
How 1
        
Buddy 2
        
and 2
        
I 1
        
up 2
        
good 1
        
doin 1
        
am 1
        
Man 1
        
you 1
        
s 2





        share|improve this answer















        Considering inputs:



        $ ls ./in*
        
./in1.txt  ./in2.txt
        
$ cat in*
        
What's up Buddy. How are you doin Buddy?
        
What's up Man. I am happy and good and awesome.


        AWK counting words with associative array, words treated as alpha characters (You will need to tune up and also create logic for upper/lower cases etc.). Note there is also added count 4 for empty string:



        $ gawk 'BEGIN { RS="[^A-Za-z]"; } { words[$0]++; } END { for ( i in words ) print(i " " words[i]); }' ./in*
        
happy 1
        
are 1
        
 4
        
What 2
        
awesome 1
        
How 1
        
Buddy 2
        
and 2
        
I 1
        
up 2
        
good 1
        
doin 1
        
am 1
        
Man 1
        
you 1
        
s 2






        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Nov 20 '18 at 12:22

























        answered Nov 20 '18 at 9:26









        KubatorKubator

        74911




        74911
































            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53323075%2fcount-of-unique-words-in-multiple-text-files-in-a-folder-using-awk-in-windows%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Xamarin.iOS Cant Deploy on Iphone

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } -1 I have a windows laptop and a mac mini my problem is that It wont deploy on iphone if I use Visual Studio Xamarin on windows to install my app, but it works fine with Visual Studio For Mac. Here's what I get after build succeded on Visual Studio Xamarin on windows : 1>------ Build started: Project: FinalCustomerApp.iOS, Configuration: Debug iPhone ------ 1> Connecting to Mac server 192.168.8.100... 1> FinalCustomerApp.iOS -> C:UsersJeremy PaulDesktopFinalCustomerAppFinalCustomerAppFinalCustomerApp.iOSbiniPhoneDebugFinalCustomerApp.iOS.exe 1> Detected signing identity: 1> Code Signing Key: &quo
            Read more

            Glorious Revolution

            Image
            "The Bloodless Revolution" redirects here. For a history of the vegetarian movement, see The Bloodless Revolution (book). This article is about the English revolution of 1688. For the revolution of 1868 in Spain, see Glorious Revolution (Spain). For other uses, see Glorious Revolution (disambiguation). Glorious Revolution The Prince of Orange lands at Torbay Date 1688–1689 Location British Isles Also known as Revolution of 1688 War of the English Succession Bloodless Revolution Participants English, Welsh and Scottish society, Dutch forces Outcome Replacement of James II by William III and Mary II Jacobite rising of 1689 Williamite War in Ireland War with France; England and Scotland join Grand Alliance Drafting of the Bill of Rights 1689 Part of a series on the History of England Timeline Prehistoric Britain Roman Britain Sub-Roman Britain Medieval period Economy in the Middle Ages Anglo-Saxon period
            Read more

            Dulmage-Mendelsohn matrix decomposition in Python

            Image
            0 Matlab has a function called dmperm that computes the so-called Dulmage–Mendelsohn decomposition of a n x n matrix. From wikipedia, the Dulmage–Mendelsohn is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. Looking both on scipy and numpy, I could not find this function, nor some similar version. Is it possible to implement it using basic linear algebra operations? Any idea if this is implemented in some Python package? python matlab linear-algebra graph-theory matrix-decomposition share | improve this question
            Read more