▁that ▁are ▁not ▁adjacent ▁in ▁the ▁reference ▁and ▁the ▁candidate ▁sentence , ▁the ▁higher ▁the ▁penalty ▁will ▁be . ▁▁ ▁In ▁order ▁to ▁compute ▁this ▁penalty , ▁un igr ams ▁are ▁grouped ▁into ▁the ▁few est ▁possible ▁ch unks , ▁where ▁a ▁chunk ▁is ▁defined ▁as ▁a ▁set ▁of ▁un igr ams ▁that ▁are ▁adjacent ▁in ▁the ▁hypothesis ▁and ▁in ▁the ▁reference . ▁The ▁longer ▁the ▁adjacent ▁ma ppings ▁between ▁the ▁candidate ▁and ▁the ▁reference , ▁the ▁fewer ▁ch unks ▁there ▁are . ▁A ▁translation ▁that ▁is ▁identical ▁to ▁the ▁reference ▁will ▁give ▁just ▁one ▁chunk . ▁The ▁penalty ▁ ▁is ▁computed ▁as ▁follows , ▁▁ ▁Where ▁c ▁is ▁the ▁number ▁of ▁ch unks , ▁and ▁ ▁is ▁the ▁number ▁of ▁un igr ams ▁that ▁have ▁been ▁mapped . ▁The ▁final ▁score ▁for ▁a ▁segment ▁is ▁calculated ▁as ▁ ▁below . ▁The ▁penalty ▁has ▁the ▁effect ▁of ▁reducing ▁the ▁ ▁by ▁up ▁to ▁ 5 0 % ▁if ▁there ▁are ▁no ▁big ram ▁or ▁longer ▁matches . ▁ ▁To ▁calculate ▁a ▁score ▁over ▁a ▁whole ▁cor pus , ▁or ▁collection ▁of ▁segments , ▁the ▁aggregate ▁values ▁for ▁, ▁ ▁and ▁ ▁are ▁taken ▁and ▁then ▁combined ▁using ▁the ▁same ▁formula . ▁The ▁algorithm ▁also ▁works ▁for ▁comparing ▁a ▁candidate ▁translation ▁against ▁more ▁than ▁one ▁reference ▁transl ations . ▁In ▁this ▁case ▁the ▁algorithm ▁comp ares ▁the ▁candidate ▁against ▁each ▁of ▁the ▁references ▁and ▁selects ▁the ▁highest ▁score . ▁ ▁Ex amples ▁ ▁Sc ore : ▁ 0 . 5 0 0 0 ▁=