Concordance

Query analysis 26 >
Shuffle 26 (1,212.2 per million)

	tag sequences </term> . We incorporate this	analysis	into a <term> diagnostic tool </term> intended	#7647 We incorporate this analysis into a diagnostic tool intended for developers of machine translation systems, and demonstrate how our application can be used by developers to explore patterns in machine translation output.
tech,14-3-C80-1073,bq	</term> proposed in empirical <term> conversation	analysis	</term> ; as a device to represent and to	#12386 as a device to represent and to use different dialog schemata proposed in empirical conversation analysis;
	shows how conventional algorithms for the	analysis	of <term> context free languages </term> can	#15312 The paper shows how conventional algorithms for the analysis of context free languages can be adapted to the CCR formalism.
tech,4-1-C90-3046,bq	. This paper proposes that <term> sentence	analysis	</term> should be treated as <term> defeasible	#16562 This paper proposes that sentence analysis should be treated as defeasible reasoning, and presents such a treatment for Japanese sentence analyses using an argumentation system by Konolige, which is a formalization of defeasible reasoning, that includes arguments and defeat rules that capture defeasibility.
other,25-6-A94-1007,bq	provides four effects : the reduction of <term>	analysis	cost </term> , the improvement of <term> word	#19840 The model is based on a balance matching operation for two lists of the feature sets, which provides four effects: the reduction ofanalysis cost, the improvement of word disambiguation, the interpretation of ellipses, and robust analysis.
tech,19-2-A92-1026,bq	techniques for <term> syntactic and pragmatic	analysis	</term> can be bolstered with methods for	#17446 However, our experience with TACITUS; especially in the MUC-3 evaluation, has shown that principled techniques for syntactic and pragmatic analysis can be bolstered with methods for achieving robustness.
tech,6-3-A92-1026,bq	three techniques for making <term> syntactic	analysis	</term> more robust --- an <term> agenda-based	#17463 We describe three techniques for making syntactic analysis more robust---an agenda-based scheduling parser, a recovery technique for failed parses, and a new technique called terminal substring parsing.
other,4-1-P01-1009,bq	</term> . This paper presents a <term> formal	analysis	</term> for a large class of <term> words </term>	#1820 This paper presents a formal analysis for a large class of words called alternative markers, which includes other (than), such (as), and besides.
tech,4-2-N06-4001,bq	</term> aims at making <term> exploratory corpus	analysis	</term> accessible to researchers who are	#10882 InfoMagnets aims at making exploratory corpus analysis accessible to researchers who are not experts in text mining.
	plausible reasoning </term> constructed from	analysis	of people 's answers to everyday questions	#11924 The paper outlines a computational theory of human plausible reasoning constructed from analysis of people's answers to everyday questions.
	in their <term> sense coverage </term> . Our	analysis	also highlights the importance of the issue	#4916 Our analysis also highlights the importance of the issue of domain dependence in evaluating WSD programs.
other,0-2-A94-1007,bq	equivalent <term> words </term> . <term> Syntactic	analysis	of the English coordinate sentences </term>	#19700 Syntactic analysis of the English coordinate sentences is one of the most difficult problems for machine translation (MT) systems.
tech,27-1-H92-1060,bq	question </term> when a full <term> linguistic	analysis	</term> fails . This <term> robust parsing	#19361 This paper describes an extension to the MIT ATIS (Air Travel Information Service) system, which allows it to answer a question when a full linguistic analysis fails.
other,19-3-P01-1009,bq	incorporating an approximation of the <term> formal	analysis	</term> that is compatible with the <term>	#1891 I show that the performance of a search engine can be improved dramatically by incorporating an approximation of the formal analysis that is compatible with the search engine's operational semantics.
	this experiment , along with a preliminary	analysis	of the factors involved in the decision	#765 The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here.
tech,4-5-A94-1007,bq	presents an <term> English coordinate structure	analysis	model </term> , which provides <term> top-down	#19791 This paper presents an English coordinate structure analysis model, which provides top-down scope information of the correct syntactic structure by taking advantage of the symmetric patterns of the parallelism.
other,40-6-A94-1007,bq	of <term> ellipses </term> , and <term> robust	analysis	</term> . This <term> model </term> was practically	#19856 The model is based on a balance matching operation for two lists of the feature sets, which provides four effects: the reduction of analysis cost, the improvement of word disambiguation, the interpretation of ellipses, and robust analysis.
tech,18-1-C92-2115,bq	considered to be more complicated than <term>	analysis	</term> and <term> generation </term> , since	#18063 The transfer phase in machine translation (MT) systems has been considered to be more complicated thananalysis and generation, since it is inherently a conglomeration of individual lexical rules.
	</term> . The interaction is limited to the	analysis	step of the <term> translation process </term>	#15702 The interaction is limited to the analysis step of the translation process.
tech,6-1-P06-4011,bq	introduces a method for <term> computational	analysis	of move structures </term> in <term> abstracts	#11703 This paper introduces a method for computational analysis of move structures in abstracts of research articles.


	in Help