未知词的英文
unknown word
例句与用法
- The derived morphological rules are intended to be used by computers to identify unknown words , i . e . words not listed in the lexicon
这些词包括数词，专有名词，缩写，复合词，外来语等等，暂时统称为未知词。 - The unknown words can be classified into two different types . the first type is of the closed type . this type of the compounds may contain unlimited number of elements , but the set of elements can be expressed by regular expressions
未知词从电脑处理语言的角度来看，必须由构词律产生(或辨识) ，不同形式的未知词经仔细分析可以分成两种不同的类型。 - Since it is world knowledge dependent , a simple way of deriving the relations between morphemic components is by examining existing unknown words . in such compounds , certain interpretable semantic relationships between morphemic components must be held . however there is no absolute means to judge whether the semantic relations between morphemic components are acceptable , i . e . the acceptability of such type of compounds is not simply yes or no
第二种是开放型，这种类型的未知词集合很难用规则语法表达得很精确，例如偏正结构的名词性复合词，修饰语和中心语之间有语意选择性关系，语意之间的结合关系不是绝对可以或不可以，而是有不同的合理程度关系。 - For each high frequency affix head , its morphological rules are automatically derived . the semantic types of their modifiers are obtained as the restriction on the rules for compounds . then the propriety of an unknown compound is estimated by the similarity measure between the semantic class of its morpheme and the semantic restriction posted in the respective rules
我们以复合词为例，从语料库中，自动抽取各类复合词中的词干意类，用以训练规则，透过比对一未知词词干意类与规则意类间的相似度，判断其是否为合理的复合词。 - For instance numeric compounds , such as natural numbers , real number , date , phone numbers etc . , are of this type . the second type is one that cannot be exactly represented by regular expressions , for they are open set and have no closed form representation . for instance , noun compounds and verb compounds are of this type
第一种是封闭型，这类型的未知词虽然数量上可能有无穷多个，但是可以用规则语法( regularexpression )形式的构词律产生，例如和数字有关的复合词，不管是自然数，小数，序数，号码，时间等都属于这种类型。
