Četnost znaků v anglickém textu
| Znak | Četnost (%) |
|---|---|
| A | 8.167% |
| B | 1.492% |
| C | 2.782% |
| D | 4.253% |
| E | 12.702% |
| F | 2.228% |
| G | 2.015% |
| H | 6.094% |
| I | 6.966% |
| J | 0.153% |
| K | 0.772% |
| L | 4.025% |
| M | 2.406% |
| N | 6.749% |
| O | 7.507% |
| P | 1.929% |
| Q | 0.095% |
| R | 5.987% |
| S | 6.327% |
| T | 9.056% |
| U | 2.758% |
| V | 0.978% |
| W | 2.360% |
| X | 0.150% |
| Y | 1.974% |
| Z | 0.074% |
Bigramy
th, er, on, an, re, he, in, ed, nd, ha, at, en, es, of, or, nt, ea, ti, to, it, st, io, le, is, ou, ar, as, de rt, ve
Trigramy
the, and, tha, ent, ion, tio, for, nde, has, nce, edt, tis, oft, sth, men
Kód
/**
* Vypise na vystup cetnost jednotlivych znaku souboru (v procentech),
* ignoruje znak noveho radku
* @param source zdrojovy soubor
* @param encoding kodovani souboru
*/
public static void count(File source, String encoding) throws UnsupportedEncodingException, IOException{
BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(source), encoding));
TreeMap<Character, Integer> occurences = new TreeMap<Character, Integer>();
String s = null;
int counter = 0;
while((s = reader.readLine())!= null){
for(int i = 0; i < s.length(); i++){
counter++;
Character curr = (Character) s.charAt(i);
if(occurences.get(curr) == null){
occurences.put(curr, new Integer(0));
} else {
occurences.put(curr, occurences.get(curr).intValue() + 1);
}
}
}
for(Character ch : occurences.keySet()){
System.out.println(ch.toString() + ": " + (occurences.get(ch).intValue()/(double)counter * 100));
}
}
Literatura
- LEWAND, Robert. Cryptological mathematics. [s.l.] : The Mathematical Association of America, 2000. 199 s. ISBN 0-88385-719-7.
