Xem 1-20 trên 887 kết quả Strings
  • [ Team LiB ] Recipe 1.12 Storing Connection Strings Problem You need to choose the best place to store connection strings that you need in your application to increase maintainability, simplify future modifications, and eliminate the need to recompile the application when it is modified.

    pdf6p luvpro 04-08-2010 49 7   Download

  • [ Team LiB ] Recipe 5.11 Exporting the Results of a Query as a String Problem You need to export the results of a query to a string in a manner similar to the GetString( ) method of the ADO Recordset. Solution Write a routine to mimic the functionality of the ADO Recordset's GetString( ) method.

    pdf4p luvpro 04-08-2010 52 6   Download

  • This paper proposes a new method for approximate string search, specifically candidate generation in spelling error correction, which is a task as follows. Given a misspelled word, the system finds words in a dictionary, which are most “similar” to the misspelled word. The paper proposes a probabilistic approach to the task, which is both accurate and efficient. The approach includes the use of a log linear model, a method for training the model, and an algorithm for finding the top k candidates. ...

    pdf10p hongdo_1 12-04-2013 16 4   Download

  • Bài giảng Collection - String cung cấp cho các bạn những kiến thức về System.Collections Namespace; ArrayList Class; SortedList Class; String. Với các bạn chuyên ngành Công nghệ thông tin thì đây là tài liệu hữu ích.

    ppt23p vnch1975 15-04-2015 18 7   Download

  • The correct forms of the equations of motion, of the boundary conditions and of the reconserved energy - momentum for the a classical rigid string are given. Certain consequences of the equations of motion are presented. We also point out that in Hamilton description of ˙ the rigid string the usual time evolution equation F = {F, H} is modified by some boundary terms

    pdf8p tuanlocmuido 19-12-2012 16 2   Download

  • Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors into translation errors by considering a forest of alternative trees, as generated by a source language parser. We propose an alternative approach to generating forests that is based on combining sub-trees within the first best parse through binarization.

    pdf11p hongdo_1 12-04-2013 21 2   Download

  • We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations explicitly, our rule extraction algorithm directly learns tree-to-string rules from aligned Treebank-style trees. As tree-to-string translation casts decoding as a tree parsing problem rather than parsing, the decoder still runs fast when adjoining is included.

    pdf10p hongdo_1 12-04-2013 20 2   Download

  • This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string translation rules from word-aligned sourceside-parsed bilingual texts. The proposed model leverages on the strengths of both tree sequence-based and forest-based translation models.

    pdf9p hongphan_1 14-04-2013 23 2   Download

  • We present a new approach for mapping natural language sentences to their formal meaning representations using stringkernel-based classifiers. Our system learns these classifiers for every production in the formal language grammar. Meaning representations for novel natural language sentences are obtained by finding the most probable semantic parse using these string classifiers. Our experiments on two realworld data sets show that this approach compares favorably to other existing systems and is particularly robust to noise. ...

    pdf8p hongvang_1 16-04-2013 20 2   Download

  • A character-based measure of similarity is an important component of many natural language processing systems, including approaches to transliteration, coreference, word alignment, spelling correction, and the identification of cognates in related vocabularies. We propose an alignment-based discriminative framework for string similarity. We gather features from substring pairs consistent with a character-based alignment of the two strings.

    pdf8p hongvang_1 16-04-2013 25 2   Download

  • This paper is concerned with learning categorial grammars in Gold’s model. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants but the question was left open for the weakest one, the non-associative variant NL. We show that the class of rigid and kvalued NL grammars is unlearnable from strings, for each k; this result is obtained by a specific construction of a limit point in the considered class, that does not use product operator. ...

    pdf8p bunbo_1 17-04-2013 18 2   Download

  • String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational problem of automatically learning from a given corpus the set of transformations presenting the best evidence. We introduce an original data structure and efficient algorithms that learn some families of transformations that are relevant for part-of-speech tagging and phonological rule systems.

    pdf8p bunthai_1 06-05-2013 19 2   Download

  • Pointers and Strings the study of strings is useful to further tie in the relationship between pointers and arrays. It also makes it easy to illustrate how some of the standard C string functions can be implemented. Finally it illustrates how and when pointers can and should be passed to functions.

    ppt86p sakuraphuong 04-06-2013 29 2   Download

  • Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referred to as string re-writing kernel, to address the problem. A string re-writing kernel measures the similarity between two pairs of strings, each pair representing re-writing of a string. It can capture the lexical and structural similarity between two pairs of sentences without the need of constructing syntactic trees.

    pdf10p nghetay_1 07-04-2013 20 1   Download

  • However, it is often desirable to consider syntactic constituents of subphrases, e.g. the hierarchical phrase X → X 1 for X 2 , X 2 de X 1 can be applied to both of the following strings in Figure 1 “A request for a purchase of shares” “filed for bankruptcy”, and get the following translation, respectively “goumai gufen de shenqing” “pochan de shenqing”.

    pdf9p nghetay_1 07-04-2013 16 1   Download

  • Tree-to-string translation rules are widely used in linguistically syntax-based statistical machine translation systems. In this paper, we propose to use deep syntactic information for obtaining fine-grained translation rules. A head-driven phrase structure grammar (HPSG) parser is used to obtain the deep syntactic information, which includes a fine-grained description of the syntactic property and a semantic representation of a sentence. We extract fine-grained rules from aligned HPSG tree/forest-string pairs and use them in our tree-to-string and string-to-tree systems. ...

    pdf10p hongdo_1 12-04-2013 16 1   Download

  • In this paper, we propose a novel string-todependency algorithm for statistical machine translation. With this new framework, we employ a target dependency language model during decoding to exploit long distance word relations, which are unavailable with a traditional n-gram language model. Our experiments show that the string-to-dependency decoder achieves 1.48 point improvement in BLEU and 2.53 point improvement in TER compared to a standard hierarchical string-tostring system on the NIST 04 Chinese-English evaluation set. ...

    pdf9p hongphan_1 15-04-2013 21 1   Download

  • We present a novel translation model based on tree-to-string alignment template (TAT) which describes the alignment between a source parse tree and a target string. A TAT is capable of generating both terminals and non-terminals and performing reordering at both low and high levels. The model is linguistically syntaxbased because TATs are extracted automatically from word-aligned, source side parsed parallel texts. To translate a source sentence, we first employ a parser to produce a source parse tree and then apply TATs to transform the tree into a target string. ...

    pdf8p hongvang_1 16-04-2013 19 1   Download

  • In this paper, we propose forest-to-string rules to enhance the expressive power of tree-to-string translation models. A forestto-string rule is capable of capturing nonsyntactic phrase pairs by describing the correspondence between multiple parse trees and one string. To integrate these rules into tree-to-string translation models, auxiliary rules are introduced to provide a generalization level.

    pdf8p hongvang_1 16-04-2013 34 1   Download

  • Sentences are not just strings of words (or are they ?), they have some (hierarchical) structure. This much is accepted by all grammar formalisms. But how much structure is needed? The more the sentences are like strings the less the need for structure. A certain amount of structure is necessary simply because a clause may embed another clause, or one clause may attach to another clause or parts of it. Leaving this need of structure aside, the question then is how much structure should a (minimal) clause have? Grammar formalisms can differ significantly on this issue. ...

    pdf1p bunmoc_1 20-04-2013 10 1   Download


Đồng bộ tài khoản