Concordance

Query to 432 >
Sort Right 432 >
Filter all but first hit in document 161 (7,506.2 per million)

two <term> formalisms </term> . We then turn	to	a discussion comparing the <term> linguistic	#14611 We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.
patterns </term> in a large <term> corpus </term> .	To	a large extent , these <term> statistics </term>	#16633 This paper presents an automatic scheme for collecting statistics on co-occurrence patterns in a large corpus. To a large extent, these statistics reflect semantic constraints and thus are used to disambiguate anaphora references and syntactic ambiguities.
Our <term> logical definition </term> leads	to	a neat relation to <term> categorial grammar	#1950 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification).
</term> from a <term> reconstruction </term>	to	a <term> recognition task </term> . Implications	#12510 It is argued that the method reduces metaphor interpretation from a reconstructionto a recognition task.
For many reasons , it is highly desirable	to	accurately estimate the <term> confidence	#6795 For many reasons, it is highly desirable to accurately estimate the confidence the system has in the correctness of each extracted field.
question-answering ( Q/A ) system </term> designed	to	address the challenges of integrating <term>	#11641 This paper describes FERRET, an interactive question-answering (Q/A) system designed to address the challenges of integrating automatic Q/A applications into real-world environments.
technology </term> development initiative	to	advance the state of the art in <term> CSR	#19543 The CSR (Connected Speech Recognition) corpus represents a new DARPA speech recognition technology development initiative to advance the state of the art in CSR.
the detected <term> homophone errors </term> .	To	align <term> bilingual texts </term> becomes	#20532 Also, the method successfully indicates the correct candidates for the detected homophone errors. To align bilingual texts becomes a crucial issue recently.
quantifiers </term> which are approximations	to	all and always , e.g. , almost all , almost	#13521 An idea which underlies the theory described in this paper is that a disposition may be viewed as a proposition with implicit fuzzy quantifiers which are approximations to all and always, e.g., almost all, almost always, most, frequently, etc.
are <term> monolingual </term> . We also refer	to	an <term> evaluation method </term> and plan	#9814 We also refer to an evaluation method and plan to compare our system's output with a benchmark system.
i.e. , retrieving examples most similar	to	an input expression , is the most dominant	#20282 In TDMT, example-retrieval (ER), i.e., retrieving examples most similar to an input expression, is the most dominant part of the total processing time.
it is fully automatic and can be applied	to	arbitrary <term> HTML documents </term> . The	#11421 The characteristics of this method is that it is fully automatic and can be applied to arbitrary HTML documents.
</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.
mirrors a forecaster 's apparent tendency	to	ascribe less precise <term> temporal adverbs	#13963 RAREAS draws on several kinds of linguistic and non-linguistic knowledge and mirrors a forecaster's apparent tendency to ascribe less precise temporal adverbs to more remote meteorological events.
complexity </term> . In this paper a novel solution	to	automatic and <term> unsupervised word sense	#10093 In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced.
In this paper , we evaluate an approach	to	automatically acquire <term> sense-tagged	#4829 In this paper, we evaluate an approach to automatically acquire sense-tagged training data from English-Chinese parallel corpora, which are then used for disambiguating the nouns in the SENSEVAL-2 English lexical sample task.
quasi-destructive scheme 's ability </term>	to	avoid <term> over copying </term> and <term>	#18026 The proposed scheme eliminates redundant copying while maintaining the quasi-destructive scheme's abilityto avoid over copying and early copying combined with its ability to handle cyclic structures without algorithmic additions.
presents a <term> machine learning </term> approach	to	bare <term> sluice disambiguation </term> in	#5156 This paper presents a machine learning approach to bare sluice disambiguation in dialogue.
complete and correct interpretations has	to	be abandoned . However , our experience	#17420 It is often assumed that when natural language processing meets the real world, the ideal of aiming for complete and correct interpretations has to be abandoned.
</term> . <term> Chat-80 </term> has been designed	to	be both efficient and easily adaptable	#12858 Chat-80 has been designed to be both efficient and easily adaptable to a variety of applications.


	in Help