Tài liệu miễn phí Báo cáo khoa học
Download Tài liệu học tập miễn phí Báo cáo khoa học
Báo cáo khoa học: A Semantics and Pragmatics
We offer a semantics and pragmatics of the pluperfect in narrative discourse. We rexamine in a formal model of implicature, how the reader's knowledge about the discourse, Gricean-maxims and causation contribute to the meaning of the pluperfect. By placing the analysis in a theory where the interactions among these knowledge resources can be precisely computed, we overcome some problems with previous Reichenbachian approaches.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Temporal Connectives in a Discourse Context
We examine the role of temporal connectives in multi-sentence discourse. In certain contexts, sentences containing temporal connectives that are equivalent in temporai structure can fail to be equivalent in terms of discourse coherence. We account for this by offering a novel, formal mechanism for accommodating the presuppositions in temporal subordinate clauses. This mechanism encompasses both accommodation by discourse aftachme,f and accommodation by temporal addition. As such, it offers a precise and systematic model of interactions between presupposed material, discourse context, and the reader's background knowledge. We show how the results of accommodation help to determine a discou~e's coherence. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension of the earlier method of syntactic connexion, discovered by Ajduckiewicz [1935]. The method amounts to find alternating spanning trees in graphs. A sketch of an algorithm for finding such a tree is provided. Interesting properties of time-complexity for this method are expected. It has some similarities with chart-parsing ([KOnig, 1991, 1992], [Hepple, 1992]) but is different at least in the fact that intervals are here edges and words are vertices...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Abductive Explanation of Dialogue Misunderstandings
To respond to an utterance, a listener must interpret what others have said and why they have said it. Misunderstandings occur when agents differ in their beliefs about what has been said or why. Our work combines intentional and social accounts of discourse, unifying theories of speech act production, interpretation, and the repair of misunderstandings.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Tuples, Discontinuity, and Gapping in Categorial Grammar
This paper solves some puzzles in the formalisation of logic for discontinuity in categorial grammar. A 'tuple' operation introduced in [Solias, 1992] is defined as a mode of prosodic combination which has associated projection functions, and consequently can support a property of unique prosodic decomposability. Discontinuity operators are defined model-theoretically by a residuation scheme which is particularly arnmenable proof-theoretically.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Abstract Finite-State Morphology
Aspects of abstract finite-state morphology are introduced and demonstrated. The use of two-way finite automata for Arabic noun stem and verb root inflection leads to abstractions based on finite-state transition network topology as well as the form and content of network arcs. Nonconcatenative morphology is distinguished from concatenative morphology by its use of movement on the output tape rather than the input tape. The idea of specific automata for classes of inflection inheriting some or all of the nodes, arc form and arc content of the abstract automaton is also introduced. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Generalized Left-Corner Parsing
We show how techniques known from generMized LR parsing can be applied to leftcorner parsing. The ~esulting parsing algorithm for context-free grammars has some advantages over generalized LR parsing: the sizes and generation times of the parsers are smaller, the produced output is more compact, and the basic parsing technique can more easily be adapted to arbitrary context-free grammars. The algorithm can be seen as an optimization of algorithms known from existing literature.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Resolving Zero Anaphora in Japanese
The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of antecedents for zero anaphora and thus leads to their efficient resolution. Also we make crucial use of functional notions such as empathy hierarchy and minimal semantics thesis to resolve reference for zero anaphora [Kuno, 1987]. Our al)proach differs from the Centering analysis [Walker et al., 1990] in that the resolution works by matching one empathy hierarchy against another, which makes it possible to deal with discourses with no explicit topic and...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Formal Properties of Metrical Structure
This paper offers a provisional mathematical typology of metrical representations. First, a family of algebras corresponding to different versions of grid and bracketed grid theory is introduced. It is subsequently shown in what way bracketed grid theory differs from metrical theories using trees. Finally, we show that there are no significant differences between the formalism of bracketed grids (for metrical structure) and the representation used in the work of [Kaye, et al., 1985], [1990] for subsyllabic structure. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Generating Contextually Appropriate Intonation
One source of unnaturalness in the output of text-to-speech systems stems from the involvement of algorithmically generated default intonation contours, applied under minimal control from syntax and semantics. It is a tribute both to the resilience of human language understanding and to the ingenuity of the inventors of these algorithms that the results are as intelligible as they are. However, the result is very frequently unnatural, and may on occasion mislead the hearer. This paper extends earlier work on the relation between syntax and intonation in language understanding in Combinatory Categorial Grammar (CCG). ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Parsing the Wall Street Journal with the Inside-Outside Algorithm
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside-outside algorithm for stochastic context-free grammars. The initial grammar for the inference process makes no ,assumption of the kinds of structures and their distributions. The inferred grammar is evaluated by its predicting power and by comparing the bracketing of held out sentences imposed by the inferred grammar with the partial bracketings of these sentences given in the corpus. Using part-of-speech tags as the only source of lexical information, high bracketing accuracy is achieved even with a small subset of the available...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by d i m e n s i o n a l adjectives, e.g. long-short in the spatial and temporal senses, near-far, fast-slow, etc. Semantic analyses of the dimensional adjectives differ on whether the meaning of the differential comparative (6 cm shorter than) and the equative with factor term (three times as long as) is a compositional function of the meanings the difference and factor terms (6 cm and three times) and the meanings of the simple comparative and equative, respectively. The compositional treatment comes at the price...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: NEW FRONTIERS BEYOND CONTEXT-FREENESS: DI-GRAMMARS AND DI-AUTOMATA
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound dependencies in a rather natural way. The place of DI-languages in the Chomsky-hierarchy will be determined: Like Aho's indexed Languages, DI-languages represent a proper subclass of Type 1 (contextsensitive languages) and properly include Type 2 (context-free languages), but the DI-class is neither a subclass nor a superclass of Aho's indexed class. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Coping With Derivation in a Morphological Component
In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level morphology [Trost, 1991a; Trost, 1991b] with a feature-based word grammar building on a hierarchical lexicon. Polymorphemic stems not explicitly stored in the lexicon are given a compositional interpretation.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Categorial grammar,modalities and algebraic semantics
This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Morrill [1990], proof-theoretic ideas of Venema [1993b; 1993a] and the theory of equational specifications, a class of resource-preserving logics is defined, for which decidability and completeness theorems are established.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that there are two distinct ways of representing the parse forest one of which involves the use of linear indexed grammars and the other the use of context-free grammars. The work presented in this paper is intended to give a general framework for studying tag parsing.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Ambiguity resolution in a reductionistic parser
W e are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in order to optimise on the accuracy of the parser, it also is beneficial for the g r a m m a r i a n to have as expressive a structural representation available as possible.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Type-Driven Semantic Interpretation of f-Structures
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a language and representations of their underlying meanings. This approach works well when the structural discrepancies between form and meaning representations are finitely bounded, but there are some phenomena in natural language, e.g. adverbs in English, where this restriction does not hold.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: DELIMITEDNESS AND TRAJECTORY-OF-MOTION EVENTS
The first part of the paper develops a novel, sortally-based approach to the problem of aspectual composition. The account is argued to be superior on both empirical and computational grounds to previous semantic approaches relying on referential homogeneity tests. While the account is restricted to manner-of-motion verbs, it does cover their interaction with mass terms, amount phrases, locative PPs, and distance, frequency, and temporal modifiers.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: VP Ellipsis in a DRT-implementation
In that approach a Predicate~DRS (henceforth PDRS) serves as the representation of a verb phrase, as will be shown in an example now. Consider: Nancy likes a cat. (1) Betty does too. This discourse is interpreted as meaning that Nancy and Betty both like a cat (though not necessarily the same cat). The source clause, Nancy likes a cat, parallels the target clause Betty does too, where the subjects are parallel elements. The phrase does too represents a trace of the VP in the target clause. Klein's treatment of (1) is shown in (2). ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Lexical Disambiguation Using Constraint Handling In Prolog
1 Introduction Automatic sense disambiguation has been recognised by the research community as very important for a number of natural language processing applications like information retrieval, machine translation, or speech recognition. This paper describes experiments with an algorithm for lexieal sense disambiguation, that is, predicting which of many possible senses of a word is intended in a given sentence.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Object clitics and clitic climbing in Italian HPS Ggrammar
Italian object clitics can be involved in nonlocal dependencies in the sense that they m u s t / m a y appear on a verbal head of which they are not an argument. Two cases where this situation arises will be discussed: the first is due to the presence of an auxiliary verb and the second is triggered by the presence of a certain class of verbs that allows clitic climbing.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Localising Barriers Theory
Government-Binding Parsing has become attractive in the last few years. A variety of systems have been designed in view of a correspondence as direct as possible with linguistic theory ([Johnson, 1989], [Pollard and Sag, 1991], [Kroch, 1989]). These approaches can be classified by their method of handling global constraints. Global constraints are syntactic in nature: They cover more than one projection. In contrast, local constraints can be checked inside a projection and, thus, lend themselves to a treatment in the lexicon. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Text Alignment in a Tool for Translating Revised Documents
Sometimes, the products themselves are modified and sometimes the new market impose changes that need to be made in the technical documentation of the products. This probably arises most frequently in the user manuals of software products. Different countries use different keyboards, different languages often require adaptation of the software itself and also, users in different countries have different expectations and norms which the documentation (if not the product itself) needs to reflect. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Lexical Choice Criteria in Language Generation
In natural language generation (NLG), a semantic representation of some k i n d - possibly enriched with pragmatic attributes - - is successively transformed into one or more linguistic utterances. No matter what particular architecture is chosen to organize this process, one of the crucial decisions to be made is lexicalization: selecting words that adequately express the content that is to be communicated and, if represented, the intentions and attitudes of the speaker.
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: A Morphological Analysis Based Method for Spelling Correction
The correction method distinguishes between orthographic errors and typographical errors. • Typographical errors (or misstypings) are uncognitive errors which do not follow linguistic criteria. • Orthographic errors are cognitive errors which occur when the writer does not know or has forgotten the correct spelling for a word. They are more persistent because of their cognitive nature, they leave worse impression and, finally, its treatment is an interesting application for language standardization purposes. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Undestanding Stories in Different Languages with GETA-RUN
We fhst built the transducer representing all the entries of DELAF along with their inflectionnal code. Each entry defines a partial function, as in: inculpons ~ inculper ,V&Pl p which corresponds to the first person plural in the present tense of the verb inculper (to charge someone). The union of these 700,000 partial functions leads to the transducer DELAF stored in 1Mb with a look-up procedme of 1,100 words per second. The 70 two-level rules that describe the way characteas ate changed when prefixes or suffixes are added to words are themselves transducers (Karttunen et al., 1992). ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Enhancing a large scale dictionary with a two-level system
We present in this paper a morphological analyzer and generator for French that contains a dictionary of 700,000 inflected words called DELAF 1, and a full twolevel system aimed at the analysis of new derivatives. Hence, this tool recognizes and generates both correct inflected forms of French simple words (DELAF lookup procedure) and new derivatives and their inflected forms (two-level analysis). Moreover, a clear distinction is made between dictionary look-up processes and new words analyses in order to clearly identify the analyses that involve heuristic rules. We tested this tool upon a French corpus of 1,300,000 words with significant...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Long Sentence Analysis by Domain-Specific Pattern Grammar
We propose a method for analyzing long complex and compound sentences that utilizes global structure analysis with domain-specific pattern grammar. Previously, long sentence analysis with global information used the following methods: two-level analysis--global structure analysis of long sentences with domain-independent function words and parsing of their constituents[Doi et al., 1991], and pattern matching--adaptation of domain-specific fixed pattern to input sentences. By utilizing domaindependent information the latter method could analyze long sentences of that domain. But since the matching is made only on the surface the sentence isn't analyzed well when patterns appear recursively. ...
8/30/2018 3:08:10 AM +00:00
Báo cáo khoa học: Knowledge acquisition for a constrained speech system using WoZ
In the last three iterations 23 subjects performed in all 107 dialogues with 28 different scenarios using a total of 4455 words. The constraints (1) and (2) above on vocabulary size and maximum and average user utterance length have been met. In the last iteration only 3 user utterances out. of 881 contained more than 10 tokens and the average number of tokens per user turn was 1.85.
8/30/2018 3:08:10 AM +00:00