Concordance

Query to 432 >
Sort Node 432 (20,140.8 per million)

support linking of <term> lexical entries </term>	to	their <term> translation equivalents </term>	#20771 This paper describes the enhancements made, within a unification framework, based on typed feature structures, in order to support linking of lexical entriesto their translation equivalents.
their <term> translation equivalents </term> .	To	help this task we have developed an <term>	#20776 This paper describes the enhancements made, within a unification framework, based on typed feature structures, in order to support linking of lexical entries to their translation equivalents. To help this task we have developed an interactive environment: TGE.
</term> . Several experiments , corresponding	to	rather <term> closed semantic domains </term>	#20793 Several experiments, corresponding to rather closed semantic domains, have been developed in order to generate lexical cross-relations between English and Spanish.
domains </term> , have been developed in order	to	generate <term> lexical cross-relations </term>	#20804 Several experiments, corresponding to rather closed semantic domains, have been developed in order to generate lexical cross-relations between English and Spanish.
<term> inheritance mechanisms </term> are used	to	capture <term> lexical generalizations </term>	#20849 Complete lexical distribution of grammatical knowledge is achieved building upon the head-oriented notions of valency and dependency, while inheritance mechanisms are used to capture lexical generalizations.
</term> in a program roughly corresponding	to	<term> arcs </term> in a <term> chart </term> .	#20910 It is also a drastic generalization of chart Parsing, partial instantiation of clauses in a program roughly corresponding to arcs in a chart.
the <term> parsing complexity </term> reduces	to	that of standard <term> chart-based algorithms	#20939 With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms.
<term> extraction and conversion rules </term>	to	<term> entries </term> from <term> machine readable	#20993 It contains a lexicon with over 90,000 entries, constructed automatically by applying a set of extraction and conversion rulesto entries from machine readable dictionaries.
strategies </term> , in a similar fashion	to	the <term> SYSCONJ system </term> developed	#21159 Despite the large amount of theoretical work done on non-constituent coordination during the last two decades, many computational systems still treat coordination using adapted parsing strategies, in a similar fashion to the SYSCONJ system developed for ATNs.
<term> language model </term> that attempts	to	capture <term> long distance constraints </term>	#21221 This paper introduces a simple mixture language model that attempts to capture long distance constraints in a sentence or paragraph.
mixture trigram models </term> as compared	to	using a <term> trigram model </term> . This	#21285 Using the BU recognition system, experiments show a 7% improvement in recognition accuracy with the mixture trigram models as compared to using a trigram model.
<term> speechrepairs </term> , and so is able	to	mark a <term> transition </term> either as	#21320 The tagger is given knowledge about category transitions for speechrepairs, and so is able to mark a transition either as a likely repair or as fluent speech.


	in Help