An A

pp
roach for Translating Mathematics
Problems in Natural Language to S
p
ecifcation
Language COKB of Intelligent Education
Software
Nhon Do Hoai Phan Truong
2
, Tuyen Trong Tran
3
1
1nformation Technology University
nhondv@uit.edu.vn
2
Economics and Law University
hoaiphan@gmail.com
3
Binh Duong University
tttuyen@live.com
Abstract - Nowadays the research on intelligent systems for
Problem solving in education has had lots of practical
applications. A system based on ECOK model and a
specifcation language can process and produce gradual guide
ways for ftll problem solving explanation. However. these
systems limit users because they require the data input and the
result output both not in natural language but specification
language, which few users knows how to use this language input
to the systems. Therefore, to improve abilit of interacting by
natural language, this paper proposes a new aproach for
translating mathematics problems in natural language to
specifcation language as well as bringing out the model of
natural language translating method associated with knowledge
base domain for efective translation. Besides, this paper shows
the abilit of this approach applied in diferent knowledge
domains.
Index Term: Artificial intelligence, Education software,
knowledge base system, automatic problem solving system.
1. INTRODUCTION
Now there are a lot of applications such as searching,
database management. .. have used knowledge base, most
of them have not been able to perform data input in
natural language (NL) yet. Such sofware required the
data input for queries requests to set up interface input
that allows users choose fom given parameters or
classifed data input. Or other applications are used in a
kind of language to specify data from a compatible
application and knowledge domain, which is called the
specifcation language (SL). Some of those are intelligent
systems for problem solving (ISPS) in geometry [2] with
user-friendly solutions explanation, which are applied to
knowledge base model of rather complete knowledge
base called ECOKB[9]. However, the problem input and
explanation output are required in SL. Or structured query
language (SQL), used to query database, is produced from
data input fom users via interfaces selectively. This
limits the ability for using the programs popularly.
978-1-4244-6936-9/10/$26.00 2010 IEEE
321
Today natural language processing is also applied in
many domains, such as classifying documents, translation
machine, etc. However, the ability of general processing
is not effective when applied to a certain knowledge
domain. Above all, Vietnamese has too many specifc
characteristics to apply some of researched results from
other languages to. Among present Vietnamese
translating methods, there have been some researches
associated with knowledge domains in progressing but
not much effect.
With such consideration, it is found necessary to design
a translation method that can translate geometry problems
from NL to SL for input data of ISPS and their solutions
from SL back to NL so that it is easier for users to use
these systems.
This research is expected to reach the aim of advancing
a model of general translation associated with knowledge
base domain, a model of knowledge base organization
and knowledge processing method as well as processes of
translation from NL into general SL. These are able to be
applied to many other domains, for example, public
administration and education ...
These available natural language processing methods
are not effective enough to be applied in every general
case and geometry problem solving systems are
particularly used for mathematics knowledge domain.
Therefore, this research experiments on analytic geometry
problems to fnd out the best approaching model (the ih
grade geometry in particular) as well as relying on
ECOKB's model of knowledge base.
2. NATURAL VIETNAMESE PROCESSING AND
INTELLIGENT PROBLEM SOLVING
SYSTEMS
2.1 Natural Vietnamese processing
Present approaches of natural language processing
have had some results in factual applications, for example,
in translation, text classifcation for searching ...
However, Vietnamese processing has been limited in
general using for different domains. Here are some results
from Vietnamese processing:
2.1.1 Methodsfor word segmentation in Vietnamese
Word segmentation and classifcation are some basic
algorithms of natural language processing which are
applied in Vietnamese. Here are some methods: -
Maximum Matching method: [in Chih-Hao Tsai, 2000] its
results are not absolutely accurate because it depends
much on dictionaries. Transformation-based Learning
(TBL) , word segmentation model with weighted fnite
state transducer (WFST) and Neural network use
linguistic labeled corus to learn those rules automatically.
However, it is difcult to construct a corpus with fll
details in Vietnamese because it takes a lot of time and
effort to do that. - Dynamic programming method: With
51 % probability of right word compared to 65%
probability of approximate word, this method is less
effective than the others above. - Internet and Genetics
Algorithm-based Text Categorization for Documents in
Vietnamese (lGATEC) has less accuracy, low running
time and is un-experimented on large data.
From the general view, the word-base method has got a
high accuracy value of over 95%, due to a large training
corpus which has been annotated accurately. However,
the algorithm output absolutely depends on this training
corpus. Above all, WFST method is the best choice
because the author's goal is to segment words accurately
for machine translation. Those methods, in which
dictionaries or training corus is essential, help us not
only segment words accurately but also base on marked
information to perform other puroses of part-of-speech
(POS) specifcation, for example, machine translation,
dictation check or synonym dictionaries ... Therefore,
word-base approach for machine translating purose has
brought worthy results in spite of rather long training time,
complex installation and training corpus constructing.
This research approach will use the most successful
method of word recognition, so building a good wordnet
is really essential. The knowledge domain is implemented
on geometry problems that it is not too difcult to make a
dictionary for word segmentation and POS tagging (WS
PT).
2.1.2 Text classication
Some works on text classifcation for text storing or
searching have achieved some satisfactory results. For
example, applications in [1] text classifcation in
Vietnamese, in [2] text classifcation for e-newspapers to
set up a multi-lingual information searching system with
phrase segmentation technique in [5]. It is used some
325
techniques of word and word form statIstIcs for text
classifcation to apply to social statistic.
2.1.3 Machine translation
Language translation research is presented with
satisfactory results; however, Vietnamese translation is
still limited in using. Experimenting with machine
translation ability is also presented in [9] in this research.
The ability of knowledge transference from NL to SL,
which is processed on computers, has got some frst
results in translating NL to SQL [6]. However, the
research is still in progress so most of other applications
today have to specify knowledge manually.
2.2 Intelligent systems for Problem
In [3], a system with a general "C-Object Solver"
package of C-Object knowledge base (COKB) in MAPLE
enables to solve problems automatically for some kinds of
geometric objects such as triangles, quadrangles ... as well
as related knowledge of deduction and manipulation
performed on C-Object model. MAPLE, the powerful
Computer Algebra sofware with programming assistance
on complex abstract data structures, is appropriate to code
problem solving models and methods.
2.2.1 Problem solving process
The problem solving process accesses C-Object (CO)
[3] based on COKB model. It also constructs the
knowledge base which the program needs to use for
deduction and manipulation. This knowledge base
includes objects, object relations, fact, operators and
rules ...
The following general diagram of problem solving
process will be explained as follows: If a problem is
required to solve, the system will be input the problem in
SL, then analyze and process it. The problem analyzing
establishes its model of objects, interested attributes,
variances, events (including events of manipulating
relations, of object classifcation ... ) and the problem's
goal. Afer that, problem solving module will carry on
explanation searching based on available knowledge base.
Finally, explanation will be presented.
<-I Know|edgesew|oesI
/ r 1
Eplaination
Hnowledge
Fig 2.2.1 The general diagram of problem solving
process.
During problem solving process, problem solving
module carries out the explanation automatically.
However, the process of problem analyzing and explicit
explanation, which are produced in NL, is implemented
manually based on users' knowledge base. This research
will put the Intelligent Analytical Geometry Problem
Solving System (IAGPSS) in experiment to learn about
its SL and knowledge presentation model, then fnd out
translation model and arrange knowledge base domain for
the purpose of proceeding with knowledge translation
knowledge, to translate NL into knowledge specifcation.
2.2.2 Plane Geomety problem solving system
According to the introduction above, Plane Geometry
problem solving system is based on C-Object knowledge
base (COKE) model. The diagram of problem solving
process with C-Object network model is presented as
above for C-Object solving (as in Fig 2.2.l). Processed
problems are specifed in the language which the system
is graspable to process called specifcation language.
From the specifcation input, the system will process to
fnd out the explanation for each step based on knowledge
base model. The interested problems are SLand
knowledge presentation model to assist translation
process.
2.2.3 Specication Language
In [3], the specifcation of problem input is presented
in two parts: (I) the hypothesis starts at
"begin_hypothesis" and ends at "end_hypothesis"; (2)
the goal starts at "begin_goal" and ends at "endoal". It
is the SL which is constructed in the problem solving
system. Its structure is:
begin_hypothesis [ {<parameters>}, { < objects
> }, {< facts > }, { operators } ] end_hypothesis
begin_goal [<goals of problem> ] end_goal
In the hypothesis, users have to specify parameters,
objects, facts ... in the problem. The parameters appeared
in the problem are present at parameter. The key words
for declaring in Object is the C-Object name in Object
Knowledge base, such as: : "DIEM" (point), "DOAN"
(segment), "GOC" (angle), "TAMGIAC"(triangle),
"TAMGIACCAN" (Isosceles triangle)... 1 Plane
geometry KE domain.
The syntax of object declaration is
[<object>, <object te>);
The Object which is specifed is the object name or
structured type of object base list. For example: "cho
aiim M" (let a point M) is presented as [M,"DIEM"], or
another example "cho tam giac ABC" (let ABC triangle)
is specifed as [TAMGlAC[A,B,C],"TAMGlAC"] in here
A,B, C is the list of points.
The facts presenting the relations or features, properties
are defned as:
[relation name,{Object list)}
326
The key words of relations are performed in "[]" such
are "CAT", "VUONG", "VUONGGOC",
"SONGSONG" ... For example: the relation of
C'nh CD c

t qnh AB(the segment CD intersects AB)

["CAT", DOAN[A,B}, DOAN[D,Cl
Moreover, declaration of/act and goal can be used the
structured type of objects which have not declared above
yet. For example, "let the points: A, B, C, D" (object with
"DIEM" type) 4 "DIEM" objects is declared, it is not
necessary to present some objects, such as "segment AB,
segment AC, segment BC" ... However, this can be used
in related fact in Fact declaration. For example:
"Doc AB vuong g6c vai aoc CD"
(The segment AB is perpendicular to the segment CD)
The fact specifcation is
VIE: ["VUONG", DOAN[A,B}, DOAN[C,Dl
E: [, segment[A,B}, segment[C,Dl
Without declaring segment AB or segment CD
VIE: ["VUONG",
[DOAN[A,B],"DOAN",[ DOAN[C,D], "DOAN"]]
ENG: ["RIGHT", [segment[A,B],"SEGMENT",
[segment[C,D],"SEGMENT"]]
Operators include operator symbols (arithmetic
operators, comparative operators), fnction and operators.
They are used to access component of object.
Parameter includes the name of const or const object, e.g.
Pi number (), 0 root coordinate in analytic geometry 2D
or 3D.
The goal specifcation is the determination of problem
which has the same structure as above. However, it adds
more action verbs such as: "chung minh rng" ("prove
that"), "giii" (solve), "so sanh"( compare), "Hnh"
(determine) ...
2.2.4 Knowledge base structure
The process of problem solving system accesses
knowledge base based on C-Object knowledge base
(COKE) model. COKB structure in [3] includes text fles
with containing construction of knowledge, which the
program uses in deducting and manipulating. It also
includes: The fles "Objects. txt", "Relations. txt", C
Object; "Hierarchy. txt" "< C-Object name>.txt"
"Operators. txt", "Facts.txt", "Rules. txt".
The Systems of Intelligent Analytical Geometry
Problem Solving have been successfl in producing
gradual guide ways for fll geometry problem solving.
They help the user have the ability to reason geometry
problems; however, their interaction with the users is not
really effective. Specifcations for Object, Relations,
Rules ... are specifed in SL, so is the explanation. These
systems, therefore, limit users because they require the
data input and the result output both not in NL but SL,
which few users knows how to use in the systems. To
achieve the goal that these systems are able to be practical
application products, the problem input requires to be
solved and be processed automatically to SL without
ofcial specialists' assistance. This research's goal is to
propose a new approach for automatic translation a
problem from NL to SL in accordance with problem
solving systems.
3. APPROACH METHOD
By analyzing and studying on SL and COK model in
intelligent solving system, the paper is presented a
method of NPL in Vietnamese for translating NL to SL
and hope these results are totally applied for other
knowledge domains. Besides, the approach method uses
Object knowledge base for Ian ua e translating.
Sentenceextactng
modu|e
[q VO1
-------- .
\
|
pre-SL
l
POSSF
database F
-------- . -
0=
|reSLsentence
I|D3CIm
DeaI PreSL
senence
sentence
fonn
module
Fig. 3.1 main prcessing method diagram
The main processing method is:
Afer the problems in NL are input, the system is
extracted to sentences and classifed to hypothesis and
goal automatically. The sentence is extracted to word and
tagged POS. This sentence is classifed and gathered to
sentence form with word segmentation and POS tagging
(POS sentence form). If a POS sentence form (POSSF)
does not exist in POSSF database, it is transformed to pre
SL sentence form (a sentence form for pre-processing
327
translating to SL sentence). Afer that, they are stored
POSSF and pre-SL sentence form into database. If
POSSF exists, or after inserted into database, a pre-SL
sentence form is given by query in POSSF database. The
sentence and pre-SL sentence form are input to pre-SL
sentence transform module. Output is pre-SL sentence,
which is a condensed and simple sentence. The output of
the sentence is SL form when the sentence is input to
detailed SL module associated with K of domain (as in
fg. 3.1)
To improve problem solving system, the Plane
Geometry knowledge base domain is chosen for testing.
This domain is used in this system in [3],[9]. The
sentences in the problems are in simple forms. If the
sentences are complex, they are changed to simple form.
The NLP algorithms are used to segment sentence and
tag POS for words. POS tagging is based on wordnet, in
which words are only on knowledge base. From
knowledge base and the problems of Plane Geometry in
Vietnam, POSSF database are built from analyzing and
classifying sentences. The method starts with extracting
sentence by sentence then searching in wordnet for
getting word's POS. The NLP algorithms are using for
this method.
With this model, structuring to POSSF database and
processing it are the most important modules. So two
main projects are:
1. Constructing a SF database with pre-SL form
11. Building a model for translating NL to SL 1
knowledge base domain with two steps:
-transforming to pre-SL sentence
-detailing pre-SL to SL sentence
3.1. Construct a SF database with pre-SL form
sentence
3.1.1 Pre-SLform sentence module
With NLP algorithms in Vietnamese, the sentence in
natural language is transformed to word form sentence by
word segmenting and POS tagging (WS-PT) module. By
testing, all sentences (over 2000 sentences) in Plane
Geometry problems are input for constructing knowledge
base (but in testing the simple sentences are used). We
have got about over 300 sentence forms in this knowledge
base domain (KED). Up till now, this database has been
updated with new ones automatically when the system
recognizes any new forms. These sentence forms will
help us research the rule to transform to pre-SL. These are
some examples of sentence forms:
dacdiem I ten I dacdiem Igioitu I ten
(ropert/name/ropert/adverb/name)
do ituong I ten I dacdiem Idoreituongl ten
( object/name/propertbject/name)
To transform to pre-SL and to store in database, all
sentence forms in solving problem system are collected
and classifed. Some pre-SL form was showed:
3.1.2 pre-SL form
a. Object dnition: ([name,"object"]
Ex:Tam giac ABC(ABC triangle). - [ABC,
"T AMGIAC"]
b. Object attribute: [oj ect. attribute]
Ex:Cho din tich tam giac ABC(let the area of
ABC triangle) :
[ ABC,"TAMGlAC"].S
c. Relation (relationname, {object set} ),
( relationname,
atribute, value])
object, value), ([ relationname,
Ex:Cnh AB vuong g6c vai BC (The segment AB is
perpendicular to BC)
- ["VUONGGOC",[AB,"CANH"],[BC,?]]
"? ": not yet know
d Property: [property,object]
Ex:Cho A vuong(A is right)-["VUONG",A ]
e. Function: (property, {object set})
Ex: Cho M la trung dim cua AB.(M is the
midpoint of AB)
- [ "trungdiem",M,AB]
3.2 Process model
Check
coincide
Fig. 3.2 SF processing diagram
NL QD||!|m
{
with
wordnet
SeIec!
prOper!ies W!-
sen!ence
328
A general algorithm for automatic transform sentence
form to pre-SL sentence form is researched for all
sentences. The sentence form and its pre-SL sentence are
stored to database. When processing, the program just
searches the sentence and its pre-SL sentences in database
without taking time to process for transforming pre-SL
sentence. If the new sentence form appears, it is processed
and inserted into database. Besides, it is easy for experts
to update for a special sentence when the wrong form in
database is checked. But here, the process algorithm is
prior. The process model of this module is presented in
fg.3.2
3.3 Build a model for translating NPL to SL in
knowledge base domain
This process includes two steps: frst step is name as
transforming to POSSF and the second one is detailing
POSSF to SL
Step 2 is the main part of research. When studying this
step, it is necessary to associate with Knowledge base of
domain to succeed on fully detailing POSSF to SL. This
process is showed in fg. 3.1 model.
a. The step for having pre-SL sentence and the step for
building sentence form database are the same. First, with
sentence form afer segmenting words and tagging POS,
pre-SL sentence form is given by searching in sentence
form database. Second, gathered with the sentence, pre
SL-sentence is shown out. For example:
Cho g6c ABC ... (let an angle ABC . . )
Sentence form: chol doituonglten
Searching in data base , result is
Cho Idoituonglten with pre-SL sentence form :
Cho [ten I doituongJ
Gathering with "let angle ABC", pre-SL sentence is:
Cho[ABC, "GOC"}
This algorithm for solve this problem is not special so we
do not present this here.
b. to detail POSSF to SL sentence
As in fggue 3.l, the pre-SL sentence from the previous
step is very close to SL sentence of problem solving
system. But how is it transformed to SL sentence? The SL
sentence is the one with full details of knowledge.
Actually, the process of transforming pre-SL sentence to
SL one is the process of adding more details to the pre-SL.
when studying the knowledge base, the NLP algorithm
and knowledge base model are found necessary to
combine, to detail SL sentence to SL one.
The problem in natural language is input then it is
extracted to the sentences. After that, they are transformed
to WS-PT sentences by WS-PT module. The pre-SL
sentence (which has not been detailed yet) is presented by
searching in SF database,. For example:
sentence "AG hi phan giac cua g6c ABC" (AG 1h
bisector of angle ABC)
pre-SL sentence is:
["PHANGIAC",[AG,?],[ABC,"GOC"]]
It will have to become:
["PHANGIAC",[DOAN[A,G],"DOAN"],[GOqA,B,C
],"GOC"]]
How to do that? The detail Pre-SL sentence module
need fll the correct value of "?" or search in knowledge
base and understand the objects as: DOAN, GOC,
TAMGlAC ... It is impossible to carry out, if only
processes by NLP algorithms are used. As in introduction,
because of expecting to be applied to some other KB
domains, this KB model and deductive algorithm need be
designed and processed independently and generally.
Purose of this model is to be used to add more details to
translate pre-SL to SL. In plane geometry knowledge base,
it is essential to specif the objects of KB. The relations
of sentence forms are also used in transforming to Pre-SL
sentence. So KB model, which is constructed, is Object
KB. When studying and collecting in COKB model [9], a
conceptual graph of Plane Geometry Object are selected
to construct for this translating program.
The object KB model is stored in XML fle
(object.xml) : the fle has some elements, such as:
<Objects>
<object name>
<object mean>
<attribute list>
<related sub object>
<sub object list >
< properties>
< ... >
In this KB model, object properties, object detail
specifcation, sub objects and some elements for detailing
object are easy to be shown out. For extern works, it is
necessary to study a general model for applying to other
KB domains.
As above, there are 5 kinds of SL term forms: object,
relation, attribute, function and propert So the process
system is divided to some modules. The system has been
fnished for 3 kinds: object, relation, property. The other
kinds are going to be studied.
Algorithms for detailing pre-SL are:
for Object kind
From pre-SL sentence, objects are given by
classifcation with sub objects and some detail elements
are shown out by searching in OKB to detail pre-SL
sentence to SL one.
For Relation and property kind
Relation names, objects, and values are given when
extracting relation kind or property kind. In fact, the
relation names and the values in SL sentence are still kept.
The objects are mainly changed in SL sentence result. The
329
process algorithm for this kind becomes: extracting the
objects in relations; after that, every object is processed as
Object kind. The details of the object are inserted into
relation for transforming pre-SL to SL.
In plane geometry knowledge base domain, the
analyzing is easily applied.
4. APPLICATION AND TESTING
The application for translating NL to SL is tested in
plane geometry knowledge base. All of problems in this
book have used. Only simple sentence form is used in the
input. If there are complex sentences, they are extracted to
simple form manually. The result is good: output is the
SL problem when a NL problem input to the system for
all of problems. For example:
A problem is that:
Cho tam giac ABC. Vuong t'i A. c'nh BC =5cm. AC
bng 3cm. tinh din tich tam giac ABC.
(let a triangle ABC. Right at A. edge BC =5cm. AC is
3cm. determine the area of ABC triangle.)
sentence segmentation and HG classifcation.
hypothesis
thaotacldoituonglten (action/object/name)
dacdiemltrangtul ten( feature/adverb/name)
doituongltenltinhchatlsoluong
(obj ect/name/properties/number)
tenltinhchatlsoluong (name/property/number)
goal
thaotac Ithuoctinhldoituong Iten( action! attribute/ Lbj ect/n
are)
then transform to pre-SL form:
hypothesis
thaotac[[ tenl" doituong"]] (action[[ name I "object"]])
["dacdiem",[tenl"?"]] (["feat\e",[naHel "?"]}
["tinhchat", [tenl" doituong"] ,soluong]
(["property" ,[ namel "Object"] ,number ])
["tinhchat",[tenl"?"], soluong]
(["property" ,[ namel"?"],number])
goal
thaotac[[ tenl" doituong"]. thuoctinh]
(action/[[ namel"object"].abbtribute)
to pre-SL sentence
hypothesis
CHO[[ ABCI"TAMGlAC"]]
(LET[[ ABCI"TRIAN GLE"]])
["VUONG" ,[AI"?"]] ([
"RIGHT" ,[AI"?"]])
["
=",[BCI"CANH"],5cm] (["
=
",[BCI"EDGE"],5cm])
["=" ,[ ACI"?"],3cm] (["=" ,[ ACI"?"],3cm])
goal
TINH[[ ABCI"T AMGIAC"].S]
(DETERMINE[[ABCI"TRIANGLE"].S])
The result is processed in "detail pre-SL to SL":
begin_exercise
begin roblem
Cho tam giac ABC. Vuong ti A. cnh BC = Scm. AC
bng 3cm. Hnh din tich tam giac ABC.
end jroblem
begin_hypothesis
[ {}, {[TAMGIAC[A,B,q,"TAMGIAC"],[A,"DIEM"],[
B,"DIEM"],[C,"DIEM"],[DOAN[B,q,"DOAN"],[DOAN
[A,q,"DOAN"]}, {DOAN[B,q.a = Scm, DOAN[A,q.a
= 3cm}, {["VUONG",A]} ]
end_hypothesis
begin_goal
[TlNH[TAMGlAC[A,B,q.S]]
end_goal
end exercise
5. CONCLUSION
The paper proposes a method for translating the
mathematics problems in natural language (NL) to
specifcation language (SL) with two main algorithms.
Transforming NL sentence to pre-SL sentence and
detailing pre-SL sentence (associated with KB model) to
SL sentence. This result improves the natural interactive
ability of the intelligent solving problem systems.
Besides, the approach for translating natural language
associated with knowledge base model is presented. This
is also shown the ability to apply to other knowledge base
domains. This may be applied to intelligent search engine
effectively.
The translation software, coded for testing in plane
Geometry, is able to translate all problems in the 7th
grade to specifcation language for input of the
intelligent problem solving system. It is working
effectively.
However, some problems have still had to be studied
for improving this work. Such as, the sentences used in
test are in simple sentence form. The more researches for
the variation of sentences and complex sentences in
natural language are required. Method of knowledge base
presentation is more changeable for applying to other
knowledge base domains. And it is necessary to have
more studies the general knowledge base model for
translating language.
REFERENCES
[1]. Dinh Dien, Hoang Kiem, Nguyen Van
Toan.vietnamese Word Segmentation. pp. 749 -756.
The sixth Natural Language Processing Pacifc Rim
Symposium, Tokyo, Japan. Natural Language
Processing Pacifc Rim Symposium 2001 (NLPRS-
2001)
[2]. Le Thanh Huong, Pham Hong Quang, and Nguyen
Thanh Thuy. An approach to automatically analyze
syntax of Vietnamese text. Joural ofInformatics 2000
[3]. Do Van Nhon, Constructing intelligent systems for
computation - Research and development of
knowledge representation models to design systems
330
for automated solving problems, PhD. thesis, National
University ofHo Chi Minh City (2001-2002).
[4]. Le An Ha, A method for word segmentation
Vietnamese. Proceddings of Corpus Linguistics 2003,
Lancaster, UK.
[5]. Nguyn Kim Anh- -Translation the conceptual graphs
queries into SQL queries -- Informatics faculty,
technology university of Ha noi
[6]. Nguyen Kim Anh, Ph\m Thi Thu Hoai- - Imperfect
natural language queries to relational databases
Infatics faculty, technology university ofHa noi
[7]. Le Thanh Huong, A Case Study on Vietnamese
Syntactic Parsing
[8]. Dinh Dien, natural language proccessing book,
Science university of . HCM city, 12/2004
[9]. Nhon do, An Ontolog for Knowledge Representation
and Applications - Proceedings Of World Academy
Of Science, Engineering And Technology Volume 32
August 2008 Issn 2070-3740