Mô hình lattice

Bài viết trình bày nghiên cứu thực nghiệm và mô phỏng số bằng mô hình lưới lattice để khảo sát ảnh hưởng của mức độ tải trọng đến sự khuếch tán của ion clorua trong thí nghiệm dầm chịu uốn bốn điểm.

11p viwalton 02-07-2024 4 1   Download

Bài giảng Thiết kế đồ họa 3DS MAX: Bài 7 Dựng hình và biến đổi đối tượng 3D, với mục tiêu bài học là trình bày đúng công dụng của lệnh: Extrude, Bend, Lathe, Shell, PathDeform, Tapre, Twist, Skew, Wave, Ripple, Noise, Edit Poly, Lattice; Mô tả chính xác ý nghĩa của các tham số trong lệnh: Extrude, Bend, Lathe, Shell, PathDeform, Tapre, Twist, Skew, Wave, Ripple, Noise, Edit Poly, Lattice.

24p cuchoami2510 18-02-2022 47 7   Download

Mục đích của luận văn là tính toán điểm chuyển pha trật tự -hỗn loạn khi nhiệt độ của hệ spin tăng dần bằng việc sử dụng các chương trình để mô phỏng hệ spin Ising 2D và xác định nhiệt độ chuyển pha Kosterlitz-Thouless (KT) trong mô hình XY. Mời các bạn cùng tham khảo.

74p capheviahe28 01-03-2021 10 2   Download

Nghiên cứu này sử dụng mô hình lưới (lattice model) để mô phỏng sự hình thành và phát triển các vi khe nứt và ảnh hưởng của nó đến hệ số thấm của cấu kiện bê tông tăng cường sợi thép (FRC). Trong mô hình này, bê tông được xem là bão hòa nước và bỏ qua ảnh hưởng của hiện tượng mao dẫn. Luật ứng xử kết hợp cơ-thủy được phát triển dựa trên mô hình cơ học phá hủy Mazars với sự tăng độ thấm của bê tông là 1 hàm lập phương của độ mở rộng vết nứt.

10p thayboitinhyeu 02-03-2020 74 2   Download

Bernard Lang defines parsing as ~ calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transducers. In this paper we investigate how we can generalize this approach for unification grammars. In particular we will concentrate on how we might the calculation of the intersection of a FSA and...

7p bunmoc_1 20-04-2013 36 2   Download

I argue that because of spelling and typing errors and other properties of typed text, the identification of words and word boundaries in general requires syntactic and semantic knowledge. A lattice representation is therefore appropriate for lexical analysis. I show how the use of such a representation in the CLARE system allows different kinds of hypothesis about word identity to be integrated in a uniform framework. I then describe a quantitative evaluation of CLARE's performance on a set of sentences into which typographic errors have been introduced. ...

8p bunmoc_1 20-04-2013 38 2   Download

A language processor is to find out a most promising sentence hypothesis for a given word lattice obtained from acoustic signal recognition. In this paper a new language processor is proposed, in which unification granunar and Markov language model are integrated in a word lattice parsing algorithm based on an augmented chart, and the island-driven parsing concept is combined with various preference-first parsing strategies defined by different construction principles and decision rules.

6p bunmoc_1 20-04-2013 46 2   Download

Languages differ in the concepts and real-world entities for which they have words and grammatical constructs. Therefore translation must sometimes be a m a t t e r of approximating the meaning of a source language text rather than finding an exact counterpart in the target language. We propose a translation framework based on Situation Theory. The basic ingredients are an information lattice, a representation scheme for utterances embedded in contexts, and a mismatch resolution scheme defined in terms of information flow.

8p bunmoc_1 20-04-2013 40 1   Download

This set of candidate surface strings, represented as a word lattice, is then rescored by a wordbigram language model, to produce the bestranked output sentence. FERGUS (Bangalore and Rambow, 2000), on the other hand, employs a model of syntactic structure during sentence realization. In simple terms, it adds a tree-based stochastic model to the approach taken by the Nitrogen system. This tree-based model chooses a best-ranked XTAG representation for a given dependency structure.

8p bunmoc_1 20-04-2013 41 1   Download

In this paper, we present a chunk based partialparsing system for spontaneous, conversational speech in unrestricted domains. W e show that the chunk parses produced by this parsing system can be usefully applied to the task of reranking Nbest lists from a speech recognizer, using a combination of chunk-based n-gram model scores and chunk coverage scores. The input for the system is Nbest lists generated from speech recognizer lattices.

7p bunrieu_1 18-04-2013 45 2   Download

The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an automaton under construction, the larcs which it reflects and the lattice nodes at their origins and extremities. An extension of the algorithm permits the inclusion of null, or epsilon, arcs in the output automaton. The algorithm has been successfully applied to lattices derived from dictionaries, i.e. very large corpora of strings. ...

7p bunrieu_1 18-04-2013 35 2   Download

Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. The iterative scaling algorithm that is used for the parameter estimation is computationally expensive while the feature selection process might require to estimate parameters for many candidate features many times.

7p bunrieu_1 18-04-2013 31 2   Download

Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in detail several new and efficient algorithms to address these more general problems and report experimental results demonstrating their usefulness.

8p bunbo_1 17-04-2013 25 1   Download

This paper presents a framework for unsupervised natural language morphology induction wherein candidate suffixes are grouped into candidate inflection classes, which are then arranged in a lattice structure. With similar candidate inflection classes placed near one another in the lattice, I propose this structure is an ideal search space in which to isolate the true inflection classes of a language. This paper discusses and motivates possible search strategies over the inflection class lattice structure. ...

6p bunbo_1 17-04-2013 36 1   Download

We present the first application of the head-driven statistical parsing model of Collins (1999) as a simultaneous language model and parser for largevocabulary speech recognition. The model is adapted to an online left to right chart-parser for word lattices, integrating acoustic, n-gram, and parser probabilities. The parser uses structural and lexical dependencies not considered by ngram models, conditioning recognition on more linguistically-grounded relationships.

8p bunbo_1 17-04-2013 36 1   Download

This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a method based on conditional random fields (CRFs). The models are encoded as deterministic weighted finite state automata, and are applied by intersecting the automata with word-lattices that are the output from a baseline recognizer. The perceptron algorithm has the benefit of automatically selecting a relatively small feature set in just a couple of passes over the training data. ...

8p bunbo_1 17-04-2013 49 2   Download

We present a technique that improves the efficiency of word-lattice parsing as used in speech recognition language modeling. Our technique applies a probabilistic parser iteratively where on each iteration it focuses on a different subset of the wordlattice. The parser’s attention is shifted towards word-lattice subsets for which there are few or no syntactic analyses posited.

7p bunbo_1 17-04-2013 38 1   Download

The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient indexing and subsequent relevance ranking of spoken documents. In experiments performed on a collection of lecture recordings — MIT iCampus data — the spoken document ranking accuracy was improved by 20% relative over the commonly used baseline of indexing the 1-best output from an automatic speech recognizer.

4p bunbo_1 17-04-2013 33 1   Download

The paper presents the Position Specific Posterior Lattice, a novel representation of automatic speech recognition lattices that naturally lends itself to efficient indexing of position information and subsequent relevance ranking of spoken documents using proximity. In experiments performed on a collection of lecture recordings — MIT iCampus data — the spoken document ranking accuracy was improved by 20% relative over the commonly used baseline of indexing the 1-best output from an automatic speech recognizer. The Mean Average Precision (MAP) increased from 0.

8p bunbo_1 17-04-2013 38 1   Download

We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic assumptions about natural language syntax. We show that the search space for grammar induction is a complete grammar lattice, which guarantees the uniqueness of the learned grammar.

8p hongvang_1 16-04-2013 40 1   Download