9 citations found. Retrieving documents...
Andrew Fall, Veronica Dahl, and Paul Tarau. Resolving Co-specification in Contexts. In Proc. of IJCAI'95 Context in Natural Language Workshop, August 1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Assumption Grammars: Parsing as Hypothetical Reasoning - Veronica Dahl, Paul Tarau   Self-citation (Dahl Tarau)   (Correct)

....processor using AGs, which incorporates all of the natural language features that were examined in isolation here. Acknowledgements We thank for support from NSERC (grants OGP0107411 and 611024) and from the FESR of the Universit e de Moncton. We also thank Andrew Fall for work reported in [13], summarized here in section 8.2. ....

Andrew Fall, Veronica Dahl, and Paul Tarau. Resolving Co-specification in Contexts. In Proc. of IJCAI'95 Context in Natural Language Workshop, August 1995.


Assumption Grammars: Parsing as Hypothetical Reasoning - Veronica Dahl, Paul Tarau   Self-citation (Dahl Tarau)   (Correct)

....methodology can of course be extended in order to incorporate subtler criteria. For instance, we can make each pronoun carry, at the end of the analysis, the whole list of its potential referents as a feature. User defined criteria can then further refine the list of candidate co specifiers, as in [12]. It is interesting to point out that in order to handle abstract co specifiers [2] such as events or propositions, all we have to do is to extend the definition so that other parts of a sentence can be identified as possible specifiers as well. For instance, for recognizing John kicked Sam on ....

....#painted. For the sentence Tim built and Anne painted the cupboard, for instance, we obtain the semantic representation: and(built(tim,the(X,cupboard(X) painted(ann,the(X,cupboard(X) which is just what we intend in this simplified example. Subtler analyses can be implemented as in [12]. 9 Implementation of Assumption Grammars 9.1 High performance implementation of AGs For reasons of efficiency we have implemented BinProlog s AGs in C. They are accessible through a set of builtins [30] AGs do not need to represent the chain of existential variables (heap represented on most ....

[Article contains additional citation context not shown here]

A. Fall, V. Dahl, and P. Tarau. Resolving co-specification in contexts. In Proc. of IJCAI Workshop on Context in Natural Language Processing, Montreal, Canada, 1995.


Reasoning With Taxonomies - Fall (1996)   (8 citations)  Self-citation (Fall)   (Correct)

.... application that we only explore superficially is natural language processing, where important uses of taxonomies include lexical specification and typed feature structures (e.g. 23, 118] We have also used taxonomies in the resolution of anaphora and cospecification in discourse processing [54] (synthesizing and extending research in [9, 84, 133] and for hypothetical reasoning [36] Equality constraints partition logical variables into coreference classes, each of which denotes an individual (which may be unspecified or partially specified) in a domain of discourse. These constraints ....

A. Fall, V. Dahl, and P. Tarau. Resolving co-specification in contexts. In Proc. Workshop on Context in Natural Language Processing, Montreal, Canada, 1995. BIBLIOGRAPHY 127


A Hypothetical Reasoning Based Framework for NL Processing - Dahl, Fall, Rochefort, Tarau (1996)   Self-citation (Fall Dahl Tarau)   (Correct)

....methodology can of course be extended in order to incorporate subtler criteria. For instance, we can make each pronoun carry, at the end of the analysis, the whole list of its potential referents as a feature. User defined criteria can then further refine the list of candidate co specifiers, as in [FDT95]. It is interesting to point out that in order to handle abstract co specifiers [Ash93] such as events or propositions, all we have to do is extend the definition so that other parts of a sentence can be identified as possible specifiers as well. For instance, for recognizing John kicked Sam on ....

....we can simply make the linear assumption that sentences are potential co specifiers for pronouns of neuter gender. It is interesting to note that Assumption Grammars provide us with yet another tool for resolving co specification: the use of multiple accumulators. This approach was investigated in [FDT95]. 4 Rule Inference We can also use assumption grammars to try out grammar rules that have not been provided but which it is reasonable to assume from examples in an input text. To exemplify, in an English grammar we can give only the morphological rule for plurals which simply adds an s to a ....

A. Fall, V. Dahl, and P. Tarau. Resolving cospecification in contexts. In Proc. of IJCAI Workshop on Context in Natural Language Processing, Montreal, Canada, 1995.


Assumption Grammars for Processing Natural Language - Dahl, Tarau, al. (1997)   (1 citation)  Self-citation (Dahl Tarau)   (Correct)

....methodology can of course be extended in order to incorporate subtler criteria. For instance, we can make each pronoun carry, at the end of the analysis, the whole list of its potential referents as a feature. User defined criteria can then further refine the list of candidate co specifiers, as in [12]. It is interesting to point out that in order to handle abstract co specifiers [2] such as events or propositions, all we have to do is to extend the definition so that other parts of a sentence can be identified as possible specifiers as well. For instance, for recognizing John kicked Sam on ....

....#painted. For the sentence Tim built and Anne painted the cupboard, for instance, we obtain the semantic representation: and(built(tim,the(X,cupboard(X) painted(ann,the(X,cupboard(X) which is just what we intend in this simplified example. Subtler analyses can be implemented as in [12]. 6 Assumption Grammars and Link Grammars It is interesting to note that AGs promote both top down and data driven thinking in the development of a grammar. We employed the latter in our data driven examples, i.e. those with rules in which a terminal symbol is the left hand side symbol. We can ....

[Article contains additional citation context not shown here]

A. Fall, V. Dahl, and P. Tarau. Resolving co-specification in contexts. In Proc. of IJCAI Workshop on Context in Natural Language Processing, Montreal, Canada, 1995.


From Assumptions to Meaning - Dahl, Tarau   Self-citation (Dahl Tarau)   (Correct)

....is portable and runs on top of generic Prolog systems. This is a practical advantage over systems like Lolli or Prolog. Acknowledgements We thank for support from NSERC (grants OGP0107411 and 611024) and from the FESR of the Universit e de Moncton. We also thank Andrew Fall for work reported in [11]. ....

Andrew Fall, Veronica Dahl, and Paul Tarau. Resolving Cospecification in Contexts. In Proc. of IJCAI'95 Context in Natural Language Workshop, August 1995.


From Assumptions to Meaning - Dahl, Tarau   Self-citation (Dahl Tarau)   (Correct)

....#painted. For the sentence Tim bu ilt and Anne pa inted the cupboard , for instance, we obtain the semantic representation: and(built(tim,the(X,cupboard(X) painted(ann,the(X,cupboard(X) which is just what we intend in this simplified example. Subtler analyses can be implemented as in [10]. 5 Conclusion and Related Work Assumption Grammars, although theoretically no more powerful than previous logic grammars, have more expressive power in that they permit the specification of rewriting transformations involving components of a string separated by arbitrary strings with the sole ....

A. Fall, V. Dahl, and P. Tarau. Resolving co-specification in contexts. In Proc. of IJCAI Workshop on Context in Natural Language Processing, Montreal, Canada, 1995.


On-line Resource Discovery Using Natural Language - Zaïane, Fall.. (1997)   (1 citation)  Self-citation (Dahl Fall Tarau)   (Correct)

....and output strings invisible. Hidden multiple accumulators are important for efficiency and for other uses than the one we exploit in this paper. Since for our purposes here, however, we can disregard them, here we shall only describe our hypothetical reasoning tools. We refer to a companion paper [DAHL95] for a description of multiple accumulators and for all details of design and implementation in BinProlog [TARA95] Intuitionistic implications temporarily assume clauses usable in later proofs. Such clauses can be used an indefinite number of times. Linear implications temporarily assume clauses ....

V. Dahl, A. Fall, and P. Tarau. Resolving co-specification in contexts. In In Proc. IJCAI'95 Workshop on Context in Language, Montreal, July 1995.


Concept-Based Retrieval using Controlled Natural Language - Zaļane, Fall, Rochefort, .. (1997)   (1 citation)  Self-citation (Dahl Fall Tarau)   (Correct)

....methodology can of course be extended in order to incorporate subtler criteria. For instance, we can make each pronoun carry, at the end of the analysis, the whole list of its potential referents as a feature. User defined criteria can then further refine the list of candidate co specifiers, as in [6]. It is interesting to point out that in order to handle abstract co specifiers [2] such as events or propositions, all we have to do is to extend the definition so that other parts of a sentence can be identified as possible specifiers as well. For instance, for recognizing John kicked Sam on ....

V. Dahl, A. Fall, and P. Tarau. Resolving co-specification in contexts. In In Proc. IJCAI'95 Workshop on Context in Language, Montreal, July 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC