SWI-Prolog Did You Know Did you know? you can turn ugraphs into graphml Search Documentation:
Predicate clumped/2
Availability::- use_module(library(lists)).(can be autoloaded)
Sourceclumped(+Items, -Pairs)
Pairs is a list of Item-Count pairs that represents the run length encoding of Items. For example: 
?- clumped([a,a,b,a,a,a,a,c,c,c], R).
R = [a-2, b-1, a-4, c-3].
Compatibility
SICStus

Examples

Counting word frequency

Counting word frequency

word_frequency_count(Words, Counts) :-
    maplist(downcase_atom, Words, LwrWords),
    msort(LwrWords, Sorted),
    clumped(Sorted, Counts).
?- word_frequency_count([a,b,'A',c,d,'B',b,e], Counts).
Counts = [a-2, b-3, c-1, d-1, e-1].
See also
- tokenize_atom/2 or split_string/4 may be used to split a text into tokens
Tags are associated to your profile if you are logged in|Report abuse
Tags:
  • functionality_needs_help
LogicalCaptain said (2021-01-21T21:52:37):0 upvotes 0 0 downvotes
Picture of user LogicalCaptain.

Missed opportunity

This doesn't run in reverse, doing run-length decoding!?!

That's just crazy.

?- clumped(X,[a-2,b-1,a-4,c-3]).
false.

angry_coffee_slurp.jpg

Not "clumped" but "counted"

The counterpart of "clumped" is "counted": getting the occurrence count of atomic terms:

This one is based on SWI-Prolog dicts (which is "output" directly as "CountsDict". One could alternatively transform it into or even workd directly with a list of pairs.

% ===
% "Items" is a list of atomic (and thus ground) terms
% that will appear as keys in an SWI-Prolog dict.
%
% "CountsDict" is an SWI-Prolog dict mapping every
% "Item" encountered in "Items" to its occurrence count.
% The tag of "CountsDict" is (unified with) "Tag".
%
% counted(+Items,-CountsDict,+Tag)
% ===

counted(Items,CountsDict,Tag) :-
   dict_create(EmptyDict,Tag,[]),
   foldl(inc_for_key,Items,EmptyDict,CountsDict).

% ---
% Private helper
% ---

inc_for_key(Item,DictIn,DictOut) :-
   assertion(atomic(Item)),     % lookup in a dict works via unification of atomic terms; make sure it's atomic
   (get_dict(Item,DictIn,Count) % how efficient is lookup in a dict (is it a linear scan for an unifiying element?)
    ->
    succ(Count,CountNext)
    ;
    CountNext=1),
   put_dict(Item,DictIn,CountNext,DictOut).

% ===
% Tests
% ===

:- begin_tests(counted).

test("count empty list",true(Result == counts{})) :-
   counted([],Result,counts).

test("#1",true(Result == foo{a:4,b:2,c:3,d:1,e:1,f:1})) :-
   counted([a,b,c,d,c,e,b,a,a,f,a,c],Result,foo).

test("#2",true(Result == foo{' ':1,!:1,',':1,'H':1,'W':1,d:1,e:1,l:3,o:2,r:1})) :-
   atom_chars("Hello, World!",Chars),
   counted(Chars,Result,foo).

:- end_tests(counted).