The thesis builds a linked grammar dictionary consisting of over 40,000 entries based on the extended algorithm of [113] with a discriminant assessment based on the information in the Vietnamese dictionary. 2.2.1. ...
Quantitative affixes: related to the measure, calculation or standard of measurement performed by the noun. Links are established between adjectives and nouns indicating the unit of measure: ApNt. For example, the link ...
Association with a noun (noun) exists when the noun (noun) is in the form of a direct or indirect complement. Whether the direct complement is a noun or a noun, a relationship is established for the noun. The noun is ...
In the case where both the 3rd and 4th subcomponents are present, ambiguity can occur as shown in Figure 2.6. In the first case the word “of” modifies “wood”, and in the second case the word “of” modifies ...
Proper nouns refer to names of objects, specific nouns indicate people, animals, plants, utensils, and objects connected to a singular or plural sub-element. The following links have been built: DpN: Connect the plural ...
Each word subcategory follows its own syntactic rules, so it has its own linking formulas. However, division into subcategories is not enough to build linking formulas because words in the same subcategory can also have ...
After studying and drawing out the features of this language model, the thesis will focus on solving the following problems: Parsing problem . This is a must-do problem when building a new syntactic representation ...
In the dependency grammar, dependency is present and the word central is required. It is assumed that from the existence of the dependent word A it can be concluded that the existence of the central word B. The ...
The symbol for the set of all correct dependency graphs of the sentence S with the set of dependencies R is GS. This can be considered as a single-layer dependency model. Dependency models according to the Prague school ...
The tree connection grammar was also built for Vietnamese in [22] by extracting from the Vietnamese treebank. In terms of language representation, a tree-connected grammar is capable of representing context-sensitive ...
The above problem is solved by the Inside – Outside Algorithm proposed by Baker in 1979 for context-free grammar [81]. This is essentially a variant of the forward – backward algorithm of the hidden Markov model ...
CHAPTER 1 OVERVIEW OF PHARMACOLOGICAL MODELS FOR NATURAL LANGUAGE According to Jurafsky [70], grammatical relations are ways of formalizing the ideas of traditional grammars such as subject or complement and other ...
Trang 5, Trang 6, Trang 7, Trang 8, Trang 9, Trang 10, Trang 11, Trang 12, Trang 13, Trang 14,