Absurdly late to the party but I thought I'd add a comment because this was causing me confusion as well.
In Kunen's book on foundations (The Foundations of Mathematics), a language consists of constants, functions and predicates (and constants are just functions that take $0$ inputs, i.e. they have $0$ arity). To specify a language you just need to say how many functions and predicates of each arity there are. The language of group theory has a constant, a unary function, and a binary function, corresponding to the identity element $e$, the inverse operation, and the group composition. The language of partially ordered sets has no functions but it does have a binary predicate $R(x,y)$ which is "intended" to be read as $x \leq y$.
A structure for a language consists of a non-empty set equipped with constants, functions, and predicates of arity corresponding to those in the language. Each predicate in the language must get a predicate in the structure, each function in the language gets a function in the structure. For the language of group theory, any non-empty domain $D$ along with a distinguished element $e^I \in D$, a unary operation $i^I: D \to D$, and a binary operation $m^I: D \times D \to D$ defines a structure in the language of group theory (here the $I$-superscript is meant to remind you this is just one interpretation of these symbols). The symbols are evocative of the group operations but they could be anything of the correct parity, because a structure for a lexicon/language is not required to obey any axioms.
As an example, if we define $D = \{0,1\}$ and $e^I = 1$, $i^I(0)=i^I(1)=0$, $m^I(x,y)=0$ for $x,y \in \{0,1\}$ then $(D, e^I, i^I, m^I)$ is a structure in the language of groups. However it is clearly not a group (there is no identity element). Similarly, $D = {a,b}$ and $R = \{(a,b), (b,a)\}$ is a structure for the language of partially ordered sets, although it clearly does not satisfy the antisymmetry property. Similarly, for a structure for the language of posets, you simply need a non-empty set and a binary relation on the set.
He uses the term model when considering a set $\Gamma$ of sentences in the language. In this case, $\Gamma$ could be the axioms of group theory (identity, inverses, associativity). For posets, this would be the formulas expressing reflexitiy, antisymmetry, and transitivity. Then a structure in language of group theory may or may not satisfy these formulas (for all relevant elements in the domain). If it does, then we say that the structure is a model for $\Gamma$. A model for the theory of groups will be a group. Similarly, a model for the theory of partially ordered sets is a structure for the language of partially ordered sets (non-empty set equipped with a binary relation) that further satisfies the properties of reflexivity, antisymmetry, and transitivity.
TL;DR: defining a structure one only needs to have the language, whereas to define a model one needs to have a set of sentences in mind. A structure for the language is something for which it makes sense to ask whether a set of sentences in the language in that language hold.