<?php

# Bugs: Wieso wird p_n bei steigendem n immer kleiner? Kann 100% überhaupt jemals erreicht werden???

include_once __DIR__ . '/func.inc.phps';

function p_n($n, $z, $is_start=false, $is_end=false) {
#	global $nlookup, $pchar_start, $pchar_end, $pchar_mid, $c_num;

#	if (!isset($pchar_mid)) $pchar_mid = unserialize(file_get_contents(__DIR__ . '/ser/count/ae_huge.ser'));
#	if (!isset($pchar_start)) $pchar_start = unserialize(file_get_contents(__DIR__ . '/ser/count_start/ae_huge.ser'));
#	if (!isset($pchar_end)) $pchar_end = unserialize(file_get_contents(__DIR__ . '/ser/count_end/ae_huge.ser'));

	global ${"nlookup_$n"};
	if (!isset(${"nlookup_$n"})) {
		${"nlookup_$n"} = unserialize(file_get_contents(__DIR__ . '/ser/neighbors'.$n.'/ae_huge.ser'));
		# Um das letzte Zeichen interpretieren zu können nutzen wir die Char-Häufigkeit
# Scoredifferenz wird zu schlecht
#		foreach ($pchar_mid as $c => $v) {
#			${"nlookup_$n"}["$c "] = $v;
#			if ($v > ${"nlookup_$n"}["max"]) ${"nlookup_$n"}["max"] = $v; 
#		}
	}

	$summanden = 0;

#	$z = strtoupper($z);
	$z .= " ";

        $p = 0; // Punkte
        for ($i=0; $i<strlen($z)-($n-1); $i++) {
                $neighbors = substr($z, $i, $n);
                $p += ${"nlookup_$n"}[$neighbors] / ${"nlookup_$n"}['max'];
		$summanden++;
        }
#       $p /= ${"nlookup_$n"}['max'];
#	$summanden += strlen($z)-($n-1);

	// Buchstabenhäufigkeit
/*
	for ($i=0; $i<strlen($z); $i++) {
		$mid_p = $pchar_mid[$z[$i]] / $pchar_mid['max'];
		$p += $mid_p;
	}
	$summanden += strlen($z);
*/

	// Analyse Ende/Start
#	if ($is_end) {
#		$end_p = $pchar_end[$z[strlen($z)-2]] / $pchar_end['max'];
#	        $p += $end_p;
#		$summanden++;
#	}
#	if ($is_start) {
#		$anfang_p = $pchar_start[0] / $pchar_start['max'];
#		$p += $anfang_p;
#		$summanden++;
#	}

	# $p /= $summanden / strlen($z) * alpha_count($z);
	$p /= $summanden;

	return $p;	
}

?>