Lexicalized Tree Adjoining Grammar (LTAG) is a highly structured formalism that captures longdistance dependencies and hierarchical constituency in a way that aligns closely with linguistic intuition. For Vietnamese, a language with subjectverbobject order, extensive use of classifiers, and a rich system of tenseaspectmodal particles, a specialised LTAG needs to handle a number of phenomena that differ from IndoEuropean languages. Metagrammar offers a systematic way to generate the large set of elementary trees required for Vietnamese by describing them compactly with higherlevel templates.
Aspect projection).Each lexical item (verb, noun, adjective, modal particle) is associated with a set of features that select appropriate templates:
lexicon(verb, [root: "i", pos: v, trans: intrans, aspect: null]).lexicon(verb, [root: "mua", pos: v, trans: trans, aspect: null]).lexicon(noun, [root: "bnh", pos: n, classifier: "ci"]).lexicon(particle,[root: "ang", pos: p, type: progressive]).
Templates are parametrised trees that the metagrammar instantiates. The most common templates for Vietnamese are:
S NP_subj VP where VP V or VP Adv* V.S NP_subj VP with VP V NP_obj.NP CL N where CL is a classifier required by the noun.VP Asp VP.Features are propagated from the lexical anchor to the tree and across adjunction sites. Example of a feature structure for a transitive verb:
[cat: v, trans: +, aspect: ?, subj: [num: ?, pers: ?], obj: [num: ?, pers: ?, classifier: ?]]
Adjunction allows us to combine independent trees without duplicating structure. Two central metarules are:
ASP tree at any VP node that matches the aspect feature of the lexical verb.Sentence: Tun ang i hc. (Tun is going to school.)
Tun (proper noun)i (intransitive)ang (progressive)hc (noun, requires no classifier)i.ASP ang VP to the VP node.The resulting derived tree yields the surface order NP_subj + ASP + V + NP_obj, matching the observed Vietnamese syntax.
Sentence: Nam mua mt chic xe my. (Nam buys a motorcycle.)
Nammua (transitive)xe my (noun)chic (used with vehicles)mtNP_obj Det CL N.Sentence: H i mua bnh. (They go buy cake.)
Hi (intransitive, motion)mua (transitive)bnh (requires classifier ci)i and TV tree for mua.NP_subj V1 V2 NP_obj.% ---------- Lexicon ----------lex(V,Root,Features) :- member(pos:v,Features), Root=Root.lex(N,Root,Features) :- member(pos:n,Features), Root=Root.lex(P,Root,Features) :- member(pos:p,Features), Root=Root.% ---------- Templates ----------template(iv, Tree) :- Tree = s(np_subj, vp(v)).template(tv, Tree) :- Tree = s(np_subj, vp(v, np_obj)).template(clp, Tree) :- Tree = np(det, cl, n).template(asp, Tree) :- Tree = vp(asp, vp).template(svc, Tree) :- Tree = s(np_subj, vp(v1, vp(v2, np_obj))).% ---------- Metarules ----------adjunct_aspect(VP, AspTree, NewVP) :- VP = vp(V), NewVP = vp(AspTree, V).adjunct_serial(V1Tree, V2Tree, NewVP) :- V1Tree = vp(V1, Rest), NewVP = vp(V1, vp(V2Tree, Rest)).
Every count noun must appear with a classifier. The metagrammar enforces this by a constraint:
noun_requires_classifier(N) :- noun(N, Features), member(classifier:_, Features) -> true ; throw(error(missing_classifier(N))).
Particles such as (perfective), ang (progressive), s (future) are treated as separate elementary trees that adjoin to the VP. Their ordering is fixed (particle precedes the verb) and is captured by the ASP template.
Vietnamese often frontends topics using a pause or a discourse particle. A lightweight toprule can be added:
template(topic, Tree) :- Tree = s(topic, rest).
Adjunction of a topic tree at the root allows Con mo, ti thch. (As for the cat, I like it.) without altering the core VP structure.
When the metagrammar is compiled into an LTAG for Vietnamese, the following empirical observations hold:
By encapsulating Vietnamesespecific syntactic constraints in a transparent set of metarules, the metagrammar approach makes the construction, maintenance, and extension of a Vietnamese LTAG both systematic and scalable.
