Concordance

Query analysis 26 (1,212.2 per million)

	The results of this experiment , along with a preliminary analysis of the factors involved in the decision making process will be presented here .	#765 The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here.
other,4-1-P01-1009,bq	This paper presents a <term> formal analysis </term> for a large class of <term> words </term> called <term> alternative markers </term> , which includes <term> other ( than ) </term> , <term> such ( as ) </term> , and <term> besides </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.
other,19-3-P01-1009,bq	I show that the <term> performance </term> of a <term> search engine </term> can be improved dramatically by incorporating an approximation of the <term> formal analysis </term> that is compatible with the <term> search engine </term> 's <term> operational semantics </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.
	Our analysis also highlights the importance of the issue of <term> domain dependence </term> in evaluating <term> WSD programs </term> .	#4916 Our analysis also highlights the importance of the issue of domain dependence in evaluating WSD programs.
	We incorporate this analysis into a <term> diagnostic tool </term> intended for <term> developers </term> of <term> machine translation systems </term> , and demonstrate how our application can be used by <term> developers </term> to explore <term> patterns </term> in <term> machine translation output </term> .	#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,0-4-P05-1048,bq	<term> Error analysis </term> suggests several key factors behind this surprising finding , including inherent limitations of current <term> statistical MT architectures </term> .	#9389 Error analysis suggests several key factors behind this surprising finding, including inherent limitations of current statistical MT architectures.
tech,4-2-N06-4001,bq	<term> InfoMagnets </term> aims at making <term> exploratory corpus analysis </term> accessible to researchers who are not experts in <term> text mining </term> .	#10882 InfoMagnets aims at making exploratory corpus analysis accessible to researchers who are not experts in text mining.
tech,15-4-N06-4001,bq	As an <term> educational tool </term> , it has been used as part of a unit on <term> protocol analysis </term> in an <term> Educational Research Methods course </term> .	#10960 As an educational tool, it has been used as part of a unit on protocol analysis in an Educational Research Methods course.
tech,6-1-P06-4011,bq	This paper introduces a method for <term> computational analysis of move structures </term> in <term> abstracts </term> of <term> research articles </term> .	#11703 This paper introduces a method for computational analysis of move structures in abstracts of research articles.
	The paper outlines a <term> computational theory </term> of <term> human 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.
tech,14-3-C80-1073,bq	as a device to represent and to use different <term> dialog schemata </term> proposed in empirical <term> conversation analysis </term> ;	#12386 as a device to represent and to use different dialog schemata proposed in empirical conversation analysis;
	The paper shows how conventional algorithms for the analysis of <term> context free languages </term> can be adapted to the <term> CCR formalism </term> .	#15312 The paper shows how conventional algorithms for the analysis of context free languages can be adapted to the CCR formalism.
	The <term> model </term> is embodied in a program , <term> APT </term> , that can reproduce segments of actual tape-recorded descriptions , using <term> organizational and discourse strategies </term> derived through analysis of our <term> corpus </term> .	#15492 The model is embodied in a program, APT, that can reproduce segments of actual tape-recorded descriptions, using organizational and discourse strategies derived through analysis of our corpus.
	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.
	<term> Implementation </term> and <term> empirical results </term> are described for the the analysis of <term> dependency structures </term> of <term> Japanese patent claim sentences </term> .	#16345 Implementation and empirical results are described for the the analysis of dependency structures of Japanese patent claim sentences.
tech,4-1-C90-3046,bq	This paper proposes that <term> sentence analysis </term> should be treated as <term> defeasible reasoning </term> , and presents such a treatment for <term> Japanese sentence analyses </term> using an <term> argumentation system </term> by Konolige , which is a <term> formalization </term> of <term> defeasible reasoning </term> , that includes <term> arguments </term> and <term> defeat rules </term> that capture <term> defeasibility </term> .	#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.
tech,19-2-A92-1026,bq	However , our experience with <term> TACITUS </term> ; especially in the <term> MUC-3 evaluation </term> , has shown that principled techniques for <term> syntactic and pragmatic analysis </term> can be bolstered with methods for achieving robustness .	#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	We describe three techniques for making <term> syntactic analysis </term> more robust --- an <term> agenda-based scheduling parser </term> , a <term> recovery technique for failed parses </term> , and a new technique called <term> terminal substring parsing </term> .	#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.
tech,18-1-C92-2115,bq	The <term> transfer phase </term> in <term> machine translation ( MT ) systems </term> has been considered to be more complicated than <term> analysis </term> and <term> generation </term> , since it is inherently a conglomeration of individual <term> lexical rules </term> .	#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.
tech,27-1-H92-1060,bq	This paper describes an extension to the <term> MIT ATIS ( Air Travel Information Service ) system </term> , which allows it to answer a <term> question </term> when a full <term> linguistic analysis </term> fails .	#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.


	in Help