35#include "EST_ling_class.h"
60 p.
set(
"NAME",
"example");
62 p.
set(
"DURATION", 2.76);
96 cout <<
"Part of speech for p is " << p.
S(
"POS") <<
endl;
97 cout <<
"Duration for p is " << p.
F(
"DURATION") <<
endl;
98 cout <<
"Stress value for p is " << p.
I(
"STRESS") <<
endl;
115 cout <<
"Part of speech for p is "
116 << p.
S(
"POS") <<
endl;
117 cout <<
"Syntactic Category for p is "
118 << p.
S(
"CAT",
"Noun") <<
endl;
138 p.
set(
"CONTINUANT",
"-");
139 p.
set(
"SONORANT",
"-");
142 p.
set(
"PLACE OF ARTICULATION", f);
144 p.
A(
"PLACE OF ARTICULATION").
set(
"CORONAL",
"+");
145 p.
A(
"PLACE OF ARTICULATION").
set(
"ANTERIOR",
"+");
155 f2.
set(
"CORONAL",
"+");
156 f2.
set(
"ANTERIOR",
"+");
158 p.
set(
"PLACE OF ARTICULATION", f2);
167 cout <<
"Anterior value is: " << p.
A(
"PLACE OF ARTICULATION").
S(
"ANTERIOR");
168 cout <<
"Coronal value is: " << p.
A(
"PLACE OF ARTICULATION").
S(
"CORONAL");
179 cout <<
"Anterior value is: " << p.
S(
"PLACE OF ARTICULATION.ANTERIOR");
180 cout <<
"Coronal value is: " << p.
S(
"PLACE OF ARTICULATION.CORONAL");
190 p.
set(
"PLACE OF ARTICULATION.CORONAL",
"+");
191 p.
set(
"PLACE OF ARTICULATION.ANTERIOR",
"+");
208 cout <<
"This is true: " << p.
f_present(
"PLACE OF ARTICULATION");
216 p.
f_remove(
"PLACE OF ARTICULATION");
245 a->
set(
"TYPE",
"consonant");
250 a->
set(
"TYPE",
"vowel");
255 a->
set(
"TYPE",
"consonant");
275 a->
set(
"TYPE",
"consonant");
280 a->
set(
"NAME",
"ei");
281 a->
set(
"TYPE",
"vowel");
291 a->
set(
"TYPE",
"consonant");
296 a->
set(
"TYPE",
"vowel");
313 for (s =
phones.head(); s != 0; s = inext(s))
333 for (s =
phones.tail(); s != 0; s = iprev(s))
363 for (s =
phones.head(); s; s = inext(s))
396 np = append_daughter(r);
397 np->set(
"CAT",
"NP");
399 n = append_daughter(
np);
400 n->
set(
"CAT",
"PRO");
402 n = append_daughter(n);
403 n->
set(
"NAME",
"John");
405 vp = append_daughter(r);
406 vp->set(
"CAT",
"VP");
408 n = append_daughter(
vp);
409 n->
set(
"CAT",
"VERB");
410 n = append_daughter(n);
411 n->
set(
"NAME",
"loves");
413 np = append_daughter(
vp);
414 np->set(
"CAT",
"NP");
416 n = append_daughter(
np);
417 n->
set(
"CAT",
"DET");
418 n = append_daughter(n);
419 n->
set(
"NAME",
"the");
421 n = append_daughter(
np);
422 n->
set(
"CAT",
"NOUN");
423 n = append_daughter(n);
424 n->
set(
"NAME",
"woman");
466 if (daughter1(n) != 0)
468 else if (inext(n) != 0)
498 for (s = first_leaf(tree.head()); s != last_leaf(tree.head());
572 for (s = first_leaf(
syntax->head()); s != last_leaf(
syntax->head());
void set(const EST_String &name, int ival)
const EST_String S(const EST_String &path) const
const int I(const EST_String &name) const
void set(const EST_String &name, int ival)
const EST_String S(const EST_String &name) const
EST_Features & A(const EST_String &name) const
const float F(const EST_String &name) const
void f_remove(const EST_String &name)
int f_present(const EST_String &name) const
EST_Relation * relation(const char *name, int err_on_not_found=1) const
get relation by name
EST_Relation * create_relation(const EST_String &relname)
create a new relation called <parameter>n</parameter>.