text stringlengths 22 301k |
|---|
@RULES
_ENDRULE [base] <- \@ \@ _xWHITE @@
#@POST
# noop()
#@RULES
#_xNIL <- _xWILD [min=1 max=1 fail=(\@)] @@
@RULES
_soRULES [base] <- \@ RULES [t] @@
_soPOST [base] <- \@ POST [t] @@
_soCHECK [base] <- \@ CHECK [t] @@
_soPRE [base] <- \@ PRE [t] @@
_soNODES [base] <- \@ NODES [t] @@
_soMULTI [base] <- \@ MULTI [t... |
# Fetch index entry for dictionary concept. Gets index concept that str would be added under.
L("return_con") = wordindex(L("str")); |
@DECL
Spaces(L("output"), L("num"), L("spaces")) {
"debug.txt" << "moose\n";
while (L("i") < L("num")) {
L("output") << L("spaces");
L("i")++;
}
}
@@DECL |
@DECL
VerticeXMLTree(
L("out"),
L("n"),
L("parent id")
)
{
L("childs") = pndown(L("n"));
L("leaf") = 0;
while (L("childs")) {
L("name") = pnname(L("childs"));
if (strlength(L("name")) > 1) {
L("id") = G("id")++;
L("tag") = strtrim(strpiece(L("name"),0,strlength(L("name"))-1));
L("out") << "<vertice";
V... |
@NODES _ROOT
@POST
N("wordcon") = dictfindword(strtolower(N("$text")));
if (N("wordcon"))
{
G("vals") = findvals(N("wordcon"),"pos");
G("first val") = "_" + strtoupper(getstrval(G("vals")));
N("pos num") = 0;
while (G("vals"))
{
G("val") = getstrval(G("vals"));
if (G("val") == "noun")
N("n... |
# Fetch the last node in phrase.
L("return_con") = lastnode(L("phrase")); |
# Find attribute and value pair in the subhierarchy of a concept.
attrexists(L("hier"), L("attr_s"), L("val_s")); |
@NODES _ROOT
@RULES
_xNIL <-
_xWILD ### (1)
@@
|
@NODES _ROOT
@POST
L("abbrev") = getconcept(G("state"),"abbrev");
addstrval(L("abbrev"),"letters",N("text"));
G("abbrev") << strtolower(N("text")) << " s=state abbrev=1 state=" << QuoteIfNeeded(G("state name")) << "\n";
@RULES
_xNIL <-
_abbrev ### (1)
@@
|
@NODES _item
@POST
X("catid") = N("$text",2);
@RULES
_xNIL <-
_categoryidOpen [s] ### (1)
_xWILD [s fails=(_categoryidClose)] ### (2)
_categoryidClose ### (3)
@@
@POST
"names.txt" << N("$text",2) << "\n";
addCategory(N("$text",2),X("catid"));
X("name") = N("$text",2);
@RULES
_xNIL <-
_n... |
@CODE
# If found new sentence breaks, do this pass.
if (!G("eos"))
exitpass();
@@CODE
#@PATH _ROOT _TEXTZONE _sent
@NODES _sent
@POST
splice(1,1);
@RULES
_xNIL <-
_EOS
@@
|
@CODE
closefile(G("file"));
@@CODE |
# Transfer confidence information from human candidate node to
# a human name that was found inside it.
@NODES _ROOT _contactZone _LINE _humanNameCandidate
@CHECK
if (X("ResumeOf") <= 0) fail();
@POST
N("ResumeOf") = X("ResumeOf"); # 12/25/99 AM.
# ninc(1, "ResumeOf")
noop();
@RULES
_xNIL <-
_humanName [s]
@@
|
@NODES _LINE
@PRE
<3,3> length(1);
<6,6> length(3);
<8,8> length(3);
<10,10> length(4);
@RULES
# Ex: (+1)\_
_phoneNumber <- _xWILD [min=1 max=1 s match=("_openPunct" "\(")] \+ [s] _xWILD [min=1 max=1 trig s layer=("_countryCode") match=("_monthNum" "1")] _xWILD [min=1 max=1 s match=("_closePunct" "\)")] _xWHITE [star... |
@NODES _LINE
@RULES
_experiencePart <- _DateRange [s] @@
# Ex: Senior\_Software\_Engineer
_experiencePart <- _xWILD [min=1 max=1 s match=("_Caps" "_jobTitle")] @@
|
@CODE
DisplayKB(G("parse"),2);
@@CODE |
@PATH _ROOT _RULES
@RECURSE littopair
@POST
rfalittopair(1)
single()
@RULES
_PAIR <- _LIT @@
@@RECURSE littopair
@POST
rfapairs(2)
single()
@RULES
_PAIRS [base] <- \[ _xWILD [match=(_LIT _PAIR \*) recurse=(littopair)] \] @@
|
# Find the kb root, then make a child concept under root named "child"
G("the root") = findroot();
# make the child concept
makeconcept(G("the root"),"child");
# do something else ...
# later on, get the string variant
G("the child") = findconcept(G("the root"),"child");
# fetch the numeric variant
G("same concept") =... |
@NODES _ROOT
@POST
if ()
single();
@RULES
_xNIL <-
_labelEntry ### (1)
@@
|
@NODES _LINE
@POST
singler(3,3)
@RULES
_CompleteSchoolName [base] <-
_xWILD [s one match=( _xSTART The _xPUNCT )]
_xWHITE [star s]
_SchoolNamePhrase [t]
@@
# Joe (SchoolNamePhrase University) -> ModSchoolPhrase(Joe University)
@RULES
_SchoolNamePhrase [base] <-
_xWILD [one s fails=( _xPUNCT _xWHITE _xN... |
@DECL
AddWord(L("person"),L("word")) {
"word.txt" << L("person") << " " << L("word") << "\n";
DictionaryWord(G("word"),"person",L("person"),"str");
}
@@DECL |
@NODES _ROOT
@RULES
_paragraph <-
_xWILD [plus match=(_LINE)] ### (2)
@@
|
@NODES _ROOT
@POST
excise(1,4);
noop();
@RULES
_xNIL <-
_xSTART
_xWILD [fail=(_xALHPA _xPUNCT)]
_xWILD [one matches=(_xALHPA _xPUNCT)]
_xWILD [fail=(\n \r)] ### (1)
_xWILD [one matches=(\n \r)] ### (3)
@@
@POST
singler(3,3);
@RULES
_term <-
_xNUM
_xWILD [fail=(_xALPHA)]
_xWILD [fail=(\n \r \")] ### (1)... |
@NODES _ROOT
@RULES
_paragraph [unsealed] <-
_sentence [s plus] ### (1)
_xWILD [s matches=(_paragraphSeparator _xEND)] ### (2)
@@ |
# Match a _verb node optionally preceded by _modal, _have, or _be nodes, reducing to _vgroup
@RULES
_vgroup <- _modal [option]
_have [option] _be [option]
_verb @@ |
@NODES _ROOT
@PRE
<1,1> var("bases");
@POST
# Check for section or subsection title.
"extract_codes.txt" << "Beginning code extraction step." << ":\n";
L("section_title") = N("section_title", 1);
L("subsection_title") = N("subsection", 1);
G("line_count") = G("line_count") + 1;
L("section_name") = pnname(N(1)) + "_"... |
@NODES _ROOT
@PRE
<1,1> var("up");
@POST
splice(1,1);
@RULES
_xNIL <-
_LINE ### (1)
@@
|
@NODES _LINE
@PRE
<1,1> cap()
@RULES
# Ex: Sweden
_countryWord <- _xWILD [min=1 max=1 s match=(Sweden USA Canada Mexico France Australia ROC USSR PRC UAR UK Spain Italy Finland Turkey Israel Egypt Yugoslavia Japan Norway Denmark Holland Germany Austria Hungary Albania Portugal Poland Greece Czechoslovakia India Pakis... |
@NODES _ROOT
@POST
singler(1,2);
@RULES
_IGNORE <-
_xSTART ### (1)
_xWILD ### (2)
_beginAbs [lookahead] ### (3)
@@
@POST
singler(2,2);
@RULES
_IGNORE <-
_endAbs ### (1)
_xWILD ### (2)
_beginFigure ### (3)
@@
@POST
singler(2,2);
@RULES
_IGNORE <-
_endAbs ### (1)
... |
@NODES _LINE
@PRE
<3,3> numrange(1, 31)
@RULES
# ambiguity, month-day-year reading is preferred.
_date [] <-
_monthNum [s layer = (_month) ]
\/ [s]
_xNUM [s layer = (_day) ]
\/ [s]
_year [s]
@@
_date [] <-
_monthNum [s layer = (_month) ]
\- [s]
_xNUM [s layer = (_day) ]
\- [s]
_year [s]
@@
_da... |
@NODES _ROOT
@PRE
<1,1> uppercase();
@RULES
_identifier <-
_xALPHA ### (1)
\: [one] ### (2)
_xALPHA
_xEND
@@
|
@PATH _ROOT _paragraph _sentence
@PRE
<1,1> var("human");
@POST
S("con") = getconcept(G("people"),strtolower(phrasetext()));
single();
@RULES
_person <-
_titleCaps ### (1)
@@
|
@CODE
L("hello") = 0;
@@CODE
@NODES _sent
# Lone noun.
@POST
pncopyvars(2);
sclearpos(1,1); # Zero out token info.
singler(2,2);
@RULES
_np <-
_xWILD [one match=(_prep _vg)]
_noun
_xWILD [one lookahead match=(_prep _conj _qEOS _xEND)]
@@
# Not sure why alpha in first position in these rules....
@CHECK
i... |
# Count nouns with variable "number" with value not equal to "plural"
@PRE
<1,1> varne("number","plural");
@POST
++G("count nonplural nouns");
@RULES
_xNIL <-
_noun
@@ |
@NODES _LINE
@RULES
_jobTitle <- _jobTitleRoot [s]
_xWHITE [s]
_jobTitleRoot [s] @@
_jobTitle <- _fieldName [s]
_xWHITE [s]
_jobTitleRoot [s] @@ |
# Fetch the string value from a KB value object.
L("return_str") = getstrval(L("val")); |
# Move concept before previous sibling. (Moves concept to the left in its list.)
movecleft(L("con")); |
@CODE
DisplayKB(findconcept(findroot(), "phrases"), 1);
@@CODE |
@NODES _LINE
@POST
X("word") = N("$text",2);
single();
@RULES
_word <-
_xSTART
_xALPHA ### (1)
@@
@POST
X("pos") = N("$text",3);
single();
@RULES
_pos <-
pos
\=
_xALPHA ### (1)
@@
|
# Rename con's named attribute to new.
renameattr(L("con"), L("name"), L("new")); |
@DECL
# Take KB string values and convert to array
# Args
# first_val: first value in kb value list
StrValsToArray(L("first_val")) {
L("arr");
L("arr_idx") = 0;
while (L("first_val")) {
L("arr")[L("arr_idx")] = getstrval(L("first_val"));
L("arr_idx")++;
L("first_val") = nextval(... |
@DECL
IsPOS(L("node"), L("pos")) {
L("vars") = pnvarnames(L("node"));
L("i") = 0;
while (L("i") < arraylength(L("vars"))) {
L("var") = L("vars")[L("i")];
if (strcontains(L("pos"), L("var"))) {
return 1;
}
L("i")++;
}
return 0;
}
@@DECL |
@NODES _LINE
@PRE
<1,1> cap();
<3,3> cap();
@RULES
# Ex: Professional\_Objective
_ObjectiveHeaderPhrase [layer=(_header )] <- Professional [s] _xWHITE [star s] Objective [s] @@
|
@CODE
DictionaryStart();
DictionaryWord("he","gender","male","str");
DictionaryWord("she","gender","female","str");
DictionaryWord("january","date","month","str");
DictionaryWord("january","number","1","num");
DictionaryEnd();
@@CODE |
# Same as addword; more principled function name.
L("return_con") = dictgetword(L("str")); |
@NODES _ROOT
@POST
singler(2,2);
@RULES
_entries <-
_split ### (1)
_xWILD [fails=(_split)] ### (2)
@@
|
@NODES _term
@POST
excise(1,1);
@RULES
_xNIL <-
_xWHITE
@@
|
@NODES _LINE
# Joe (SchoolNamePhrase University) -> ModSchoolPhrase(Joe University)
@RULES
_SchoolNamePhrase [base] <-
_xWILD
[one s fails=(
_xPUNCT _xWHITE _xNUM _degree _degreePhrase
_major _minor _gpa from at in by
_DateRange _SingleDate _CityState )] # 10/09/99 PS
_xWHITE [one s] # 10/07/9... |
@PATH _ROOT _translations _headerZone _LINE
@RULES
_translation <-
_xWILD [plus match=(_xALPHA)] ### (1)
@@ |
@NODES _ROOT
@POST
S("pos") = N("$text",2);
S("con") = getconcept(G("funcs"),N("$text",2));
single();
@RULES
_pos <-
const ### (1)
_xALPHA ### (2)
\= ### (3)
_brackets ### (4)
@@
|
# Fetch string-value of attribute (must be first).
L("return_str") = strval(L("con"), L("name")); |
###############################################
# FILE: custom_funcs
# SUBJ: comment
# AUTH: Ashton
# MODIFIED:
###############################################
@DECL
# Concatenate
# Concatenates two non-empty arrays
#
# Args: Two non-empty arrayd
# Returns: concatenated array
Concatenate(L("arr_1"), L("arr_2")) {
... |
@CODE
# Traverse rare split of eui_to_codes concept, saving sum total
# and adding eui/count to kb
G("rare_eui_sum") = 0;
G("rare_eui_exp_sum") = 0;
L("iter") = down(G("eui_to_codes_rare"));
while (L("iter")) {
# Get all codes for eui
L("codes") = findvals(L("iter"), "codes");
# Create concept for code i... |
# @MULTI _section _sentence _subsection
# @POST
# L("pn_iter") = N(1);
# L("wrote") = 0;
# while (L("pn_iter")) {
# L("bases") = pnvar(L("pn_iter"), "bases")
# if (L("bases")) {
# if (strcontains("|",L("bases"))) {
# L("all_bases") = split(L("bases"), "|");
# AddUniqueCon(G("note_euis"), pnname(L("pn_iter"... |
# Split a string into pieces using a separator character
@CODE
L("arr") = split("ab|cd|efg",
"|");
"output.txt"
<< L("arr") << "\n";
"output.txt"
<< L("arr")[2] << "\n";
prints out:
ab cd efg
efg |
@CODE
L("hello") = 0;
@@CODE
#@PATH _ROOT _TEXTZONE _sent
@NODES _sent
# ^ alpha ,
@PRE
<2,2> var("adv");
<2,2> varz("inc100 ^-alpha-comma");
@POST
alphatoadv(2);
N("inc100 ^-alpha-comma",2) = 1;
@RULES
_xNIL <-
_xSTART
_xALPHA
\, [lookahead]
@@
# TOO BROAD. Could be imperative etc. #
# ^ alpha
#@PRE
#<2,2>... |
@NODES _LINE
@POST
S("header") = N("$text",2);
X("header") = 1;
S("count") = strlength(N("$text",1));
"headers.txt" << SpacesStr(S("count")) << S("count") << " " << S("header") << "\n";
if (S("count") > G("max header"))
G("max header") = S("count");
single();
@RULES
_header <-
_xWILD [min=2 match=(\=)] ### (1)
_x... |
@NODES _ROOT
@POST
AddUniqueStr(G("alphaNumeric"), "terms", N("$text", 1) + N("$text", 2));
single();
@RULES
_alphaNum <-
_xALPHA ### (1)
_xNUM ### (2)
@@ |
@PATH _ROOT
@POST
S("ref") = N("ref",1);
"bib.txt" << "Ref: " << S("ref") << "\n";
single();
@RULES
_bibItem <-
_bibRef ### (1)
_xWILD [fail=(_bibRef _endBib)] ### (2)
@@
|
# Create two children concepts then delete them both. Then create them again and deletes one by name:
if(findconcept(findroot(),"a concept"))
rmconcept(findconcept(findroot(),"a concept"));
G("aParent")= makeconcept(findroot(),"a concept")
G("aChild") = makeconcept(G("aParent"),"a child");
G("aChild") = makeconcept(G... |
@CODE
DictionaryClear();
DictionaryWord("intact","nominal", "true", "str");
DictionaryEnd();
@@CODE
|
@NODES _ROOT
@RULES
_paragraph [unsealed] <-
_sentence [s plus] ### (1)
_xWILD [s matches=(_paragraphSeparator _xEND)] ### (2)
@@ |
@NODES _ROOT
@PRE
<2,2> uppercase();
@POST
S("header") = N("$text", 2);
singler(2,3);
@RULES
_zoneHeader <-
_xWILD [one matches=(\n \r _header)] ### (1)
_xALPHA [plus] ### (2)
_xWILD [one matches=(\n \r)] ### (3)
@@ |
# Find entire path of dictionary concept for the given string. (If not present, don't add the word.)
@CODE
"output.txt" << "1 " << conceptname(addword("hello")) << "\n";
"output.txt" << "2 " << conceptname(wordindex("hello")) << "\n";
"output.txt" << "3 " << findwordpath("hello") << "\n";
"output.txt" << "4 " << find... |
@NODES _paragraph
@POST
singler(2,2);
@RULES
_endSent <-
_xWILD [s one match=(_xALPHA _xNUM)] ### (1)
_xWILD [one trig match=(\. \? \!)] ### (2)
_xWILD [one match=(_xWHITE _xALPHA _xNUM _xEND _xCTRL)] ### (3)
@@
|
@NODES _LINE
@POST
S("con") = N("$text",2);
X("con") = N("$text",2);
single();
@RULES
_con <-
\" ### (1)
_xWILD [fail=(\")] ### (2)
\" ### (3)
@@
|
@CODE
DisplayKB(G("resumes"),1);
@@CODE |
@NODES _LINE
@POST
L("node") = N(1);
L("last") = 0;
L("final") = 0;
"number.txt" << phrasetext() << "\n";
while (L("node")) {
L("name") = pnname(L("node"));
if (L("name") != "," && L("name") != "-" && L("name") != "and" && L("name") != "&") {
L("num") = num(pnvar(L("node"),... |
@NODES _term
@POST
G("root") = makeconcept(G("radlex"), N("$text", 1));
exitpass();
@RULES
_xNIL <-
_xWILD [fail=(\t \n \r)] ### (1) ### (2)
_xWILD [one matches=(\n \r)] ### (3)
@@
|
# Rename an attribute named oldAttrNameStr to newAttrNameStr belonging to the concept aConcept
if(findconcept(findroot(),"apples"))
rmconcept(findconcept(findroot(),"apples"));
G("apples") = makeconcept(findroot(),"apples");
addstrval(G("apples"),"have","seeds");
renameconcept(G("apples"),"fruit");
"output.txt" << co... |
@NODES _ROOT
@PRE
<3,3> var("lang");
<5,5> var("pos");
@RULES
_lang <-
\{ ### (1)
\{ ### (2)
_xALPHA ### (3)
\- ### (4)
_xALPHA ### (5)
_xWILD [fail=(\})] ### (6)
\} ### (7)
\} ### (8)
@@
@RULES
_curly <-
\{ ### (1)
\{ ### (2)
_xWIL... |
# Check if first char of string1 is uppercase
@CHECK
if (strisupper(N("$text",1)))
fail();
@RULES
_modal <- will @@ |
@NODES _LINE
@POST
X("code",2) = strtolower(N("$text",2));
single();
@RULES
_code <-
\[ ### (1)
_xALPHA ### (2)
\] ### (3)
@@
|
@MULTI _ROOT
@PRE
<1,1> var("key_words");
@POST
"pass_25.txt" << N("key_words", 1) << "\n";
extractCodeRanks(N("key_words", 1), "diagnoses");
extractCodeRanks(N("key_words", 1), "procedures");
@RULES
_xNIL <-
_xWILD [one matches=( _section _subsection _sentence _looseText _item)]
@@ |
@CODE
# Get our eui to codes mapping
G("eui_to_codes") = getconcept(findroot(),"eui_to_codes");
G("eui_to_codes_top") = getconcept(G("eui_to_codes"),"top");
G("eui_to_codes_rare") = getconcept(G("eui_to_codes"),"rare");
DisplayKB(findroot(), 2);
# Check whether P_eui concept exists, if not, create it.
G("P_eui") =... |
@NODES _ROOT
@RULES
_patientID <-
\[ ### (1)
\* ### (2)
\* ### (3)
_xWILD [fails=(\*)] ### (4)
\* ### (5)
\* ### (6)
\] ### (7)
@@
@RULES
_time <-
_xNUM
\:
_xNUM
\: [opt]
_xNUM [opt]
\_ [opt]
_xWILD [opt match=(am pm AM PM)]
@@
@POST
excise(6,6);
excise(4,4);
excise(2,2);
... |
@CODE
L("hello") = 0;
@@CODE
#@PATH _ROOT _TEXTZONE _tok
@NODES _tok
# Treebank note: JJ is the default, since alpha-alpha
# nonheads of nps are about 77% adjective.
@POST
X("hyphenated") = 1;
X("pos_np") = "JJ"; # Default. # 06/07/06 AM.
if (strisupper(N("$text",2)) || strisupper(N("$text",4)))
X("cap") =... |
@PATH _ROOT _experienceZone _experienceInstance _LINE
# name regardless of position, etc. Should raise confidence here.
# May want to collect confidence in the instance.
@CHECK
if (
!X("company name",3)
&& (N("tmp") = (X("lineno") - X("anchor lineno",3)))
&& (N("tmp") == -1 || N("tmp") == 1) # Within 2 lines of ... |
@NODES _LINE
@POST
S("str") = N("str");
S("str") = 1;
excise(3,3);
excise(1,1);
single();
@RULES
_item <-
\" ### (1)
_xWILD [plus fail=(\")] ### (2)
\" ### (3)
@@
|
@CODE
L("hello") = 0;
@@CODE
@NODES _TEXTZONE
@POST
++X("line count",2);
splice(1,1);
@RULES
_xNIL <-
_LINE
@@
|
# Format the current date and time as a string
@CODE
"output.txt" << today() << "\n";
@@CODE |
@NODES _ROOT
@POST
G("file") << N("$text") << "\n";
@RULES
_xNIL <-
_LINE
@@
|
@CODE
G("word dict") = G("$kbpath") + "vocab.dict";
L("debugpath") = G("$kbpath") + "debug.txt";
@@CODE |
@NODES _ROOT
@PRE
<1,1> var("negation");
@POST
if (N("negation")=="CONJ") {
pnrename(N(1), "_conj");
}
else {
pnrename(N(1), "_negation");
}
@RULES
_xNIL <-
_phrase ### (1)
@@
@PRE
<1,1> var("negation");
@POST
S("negation") = pnvar(N(1), "negation");
single();
@RULES
_negation <-
_xALPHA [one] ### (1)
@@ |
@NODES _ROOT
@POST
"verb.txt" << N("$text",4) << "\n";
single();
@RULES
_header <-
\< ### (1)
h2 ### (2)
\> ### (3)
_xALPHA ### (4)
Conjugation ### (5)
\: ### (6)
Present ### (7)
Tense ### (8)
\< ### (9)
\/ ### (10)
h2 ### (11)
\> ### (12)
@@
@RULES
_tbodyStart <-
\< ### (1)
tbody #... |
@CODE
fileout("skills.txt");
#varstrs("skills")
@@CODE
@NODES _LINE
@POST
addstrs("skills",1);
prrange("skills.txt",1,1);
prlit("skills.txt","\n");
@RULES
_xNIL <- _skill [s] @@
|
@NODES _ROOT
@POST
S("header") = N("header",1);
S("count") = 5;
single();
@RULES
_headerZone <-
_headerFive ### (1)
_xWILD [plus fails=(_headerFive _headerFour _headerThree _headerTwo _xEND)] ### (2)
@@
|
@NODES _LINE
@POST
singler(3,3);
@RULES
_rouge <-
_space ### (1)
_xWILD [plus fails=(_space)] ### (2)
_space ### (3)
@@
|
@NODES _LINE
@RULES
_email <-
_xWILD [plus match=(_xALPHA _xNUM \_ \.)] ### (1)
\@ ### (2)
_xWILD [min=2 match=(_xALPHA _xNUM \.)] ### (3)
@@
|
@CODE
G("filepath") = G("$kbpath") + "\\" + "en-firstnames.dict";
L("type") = "app";
if (!G("$isdirrun") || G("$isfirstfile"))
G("file") = openfile(G("filepath"));
else
G("file") = openfile(G("filepath"),"app");
@@CODE |
@NODES _LINE
@POST
group(2,2,"_item");
@RULES
_xNIL <-
_xSTART ### (1)
_comma ### (2)
@@ |
@NODES _LINE
@RULES
# Ex: whose
_posPRO [layer=(_funWORD )] <- _xWILD [min=1 max=1 s match=("whose" "me" "myself" "my" "mine" "we" "us" "ourselves" "our"
"ours" "you" "yourself" "yourselves" "your" "yours" "he" "him" "himself" "his"
"she" "her" "herself" "hers" "it" "itself" "its" "they" "them" "themselves"
"their... |
@CODE
sortchilds(G("adjMatrixData"));
L("i") = 0;
L("con") = down(G("adjMatrixData"));
while( L("con") ) {
addnumval(L("con"), "index", L("i"));
++L("i");
L("con") = next(L("con"));
}
@@CODE |
# Fetch numeric-value of attribute (must be first).
L("return_num") = numval(L("con"), L("name")); |
@CODE
prlit( "edu.txt", "KEY= 0-none,1-major,2-minor,3-school,\n" );
prlit( "edu.txt", " 4-degree,5-grade,6-date\n\n");
prlit( "edu.txt", "LINE DATA IN EDUCATION ZONE\n" );
prlit( "edu.txt", "---------------------------\n" );
prlit( "edu.txt", " NEW TOT FIRST LAST MAJ MIN SCH DEG GPA DAT\n" );
prlit( "edu.txt",... |
@NODES _ROOT
@RULES
_test <-
_code ### (1)
@@
|
@NODES _LINE
@RULES
# Ex: Extension\_
_phoneExtension <- _xWILD [min=1 max=1 s layer=("_extendWord") match=("Extension" "Ext" "Ex" "x")] _xWHITE [star s] _xNUM [s layer=("_extension")] @@
@PRE
<1,1> cap();
@RULES
# Ex: Ext.\_
_phoneExtension <- _xWILD [min=1 max=1 s layer=("_extendWord") match=("Ext" "Ex")] \. [s] ... |
@CODE
#DisplayKB(G("labels"), 1);
DisplayKB(G("phrases"), 1);
# Replace "labels.kb" with file path to store in different dir
#kbdumptree(G("labels"), "labels.kb");
DumpKB(G("phrases"), "phrases");
DictionaryEnd();
@@CODE
|
@CODE
DisplayKB(G("kb"),0);
@@CODE |
@CODE
G("dictfile") = G("$kbpath") + "states.dict";
G("abbrevdict") = G("$kbpath") + "abbrev.dict";
G("kbbfile") = G("$kbpath") + "states.kbb";
G("citiesdict") = G("$kbpath") + "cities.dict";
G("debugfile") = G("$kbpath") + "debug.txt";
G("debug") = openfile(G("debugfile"),"app");
G("state name") = strsubst(G("$inp... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.