Suppose each of 1342 gismu is represented by a dot (vertex) on a sheet of paper. Now let us connect with a line (link) those gismu which differ only in one letter. The resulting picture is a graph consisting of vertices and links. The number of links attached to a vertex varies from 0 to 10.
The statistics is the following:
#of links #of vertices
0 497
1 361
2 226
3 134
4 65
5 35
6 15
7 6
8 2
10 1 (barna)
-----
1342
The champion is barna: 10 links
2 gismu have 8 links:
6 gismu have 7 links:
15 gismu have 6 links:
et cetera...
As a result, the totality of gismu will be split into groups (connected components) such that any two gismu within the same group can be connected by a continous line (that is one gismu can be obtained from another via a sequence of steps changing one letter at a time).
The statistics is the following:
size of group #of groups
1 497
2 90
3 29
4 14
5 5
6 4
7 1
8 1
9 4
11 1
26 1
33 1
60 1
131 1
161 1
--- -
1342 gismu 651 group
Curiously, on the map of the gismu space there are 2 huge continents (161 and 131 gismu), 3 smaller subcontinents (60, 33, 26) and an archipelago of smaller islands (sizes from 11 to 1 gismu).
Here is the list of the biggest cluster (161 gismu):
and of the second biggest one (131 gismu):
The gismu are given above in no particular order. The proper representaion would be a graphic one (vertices and links) but it needs a lot of handwork.
For any pair of gismu belonging to the same connected components we can introduce a distance as the minimal number of links connecting them. The maximal distance between two gismu turns out to be 27. There are only 4 chains of the length 27:
The 4 chains are basically variants of the same sequence starting with cunmi-curmi- or farvi-carvi, continuing as
carmi-tarmi-tarbi-marbi-marji-sarji-sanji-ranji-ranti-manti-manri-xanri-xagri-xagji-tagji-tadji-tadni-xadni-xalni-balni-bakri-badri-gadri-gacri-
and finishing with -lacri or -vacri.
When I have time, I'll put more details on my website --mi'e .evgenis.
doi .evgenis. .e'osai ko ranji skicu .i mi ba'e se cinri — mi'e nitcion.
there is unix graph making software (da vinci?) which can take a file of a network-ish description like you want to make, and produce graphical output. debian has used it for displaying the web of trust in the past. --jay
graphviz
sodipodi also works — mi'e tcravys.