Structured finite

Xem 1-20 trên 110 kết quả Structured finite
  • A mixed prefix-postfix notation for representations of the constituent structures of the expressions of natural languages is proposed, which are of limited degree of center embedding if the original expressions are noncenter-embedding. The method of constructing these representations is applicable to expressions with center embedding, and results in representations which seem to reflect the ways in which people actually parse those expressions. Both the representations and their interpretations can be computed from the expressions from left to right by finite-state devices. ...

    pdf4p bungio_1 03-05-2013 11 1   Download

  • Autodesk Robot™ Structural Analysis Professional software is a collaborative, versatile, and faster software application that can help you compete and win in the global economy. Purpose-built for BIM, Autodesk Robot Structural Analysis Professional calculates even your more complex models with powerful finite element auto-meshing, nonlinear algorithms, and a comprehensive collection of design codes to help you achieve results in minutes, not hours.

    pdf6p nguyennam129 23-03-2013 106 26   Download

  • This book is written for marine structural engineers and naval architects, as well as mechanical engineers and civil engineers who work on struch~ral design. The preparation of the book is motivated by extensive use of the finite element analysis and dynamidfatigue analysis, fast paced advances in computer and information technology, and application of risk and reliability methods.

    pdf634p nhatkyvodanh 11-08-2012 58 19   Download

  • In the past few decades, the Finite Element Analysis (FEA) has been developed into a key indispensable technology in the modeling and simulation of various engineering systems.

    pdf0p cucdai_1 19-10-2012 39 16   Download

  • Stack ADTDEFINITION: A Stackof elements of type T is a finite sequence of elements of T, in which all insertions and deletions are restricted to one end, called the top. Stackis a Last In -First Out (LIFO) data structure.Basic operations: •Construct a stack, leaving it empty. •Pushan element. •Popan element. •Top an element.

    pdf31p trinh02 28-01-2013 25 3   Download

  • We consider a new subproblem of unsupervised parsing from raw text, unsupervised partial parsing—the unsupervised version of text chunking. We show that addressing this task directly, using probabilistic finite-state methods, produces better results than relying on the local predictions of a current best unsupervised parser, Seginer’s (2007) CCL. These finite-state models are combined in a cascade to produce more general (full-sentence) constituent structures; doing so outperforms CCL by a wide margin in unlabeled PARSEVAL scores for English, German and Chinese. ...

    pdf10p hongdo_1 12-04-2013 30 2   Download

  • In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation associated with different structures is duplicated. In this paper we describe a precompilation technique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automatonbased parser. ...

    pdf7p bunrieu_1 18-04-2013 18 2   Download

  • This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explicitly calculated sample complexity learning times under different input distribution assumptions (including CHILDES database language input) and learning regimes. We also briefly describe a new way to formally model (rapid) diachronic syntax change.

    pdf10p bunmoc_1 20-04-2013 17 2   Download

  • Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. Although computational algorithms for unification of feature structures have been worked out in experimental research, these algcwithms become quite complicated, and a more precise description of feature structures is desirable. We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.

    pdf10p bungio_1 03-05-2013 16 2   Download

  • This report describes the development of a parsing system for written Swedish and is focused on a grammar, the main component of the system, semiautomatically extracted from corpora. A cascaded, finite-state algorithm is applied to the grammar in which the input contains coarse-grained semantic class information, and the output produced reflects not only the syntactic structure of the input, but grammatical functions as well. The grammar has been tested on a variety of random samples of different text genres, achieving precision and recall of 94.62% and 91.

    pdf4p bunthai_1 06-05-2013 12 2   Download

  • The Finite element approach is actually a numerical method for solving differential equations generated by theories of mechanics such as elasticity theory and strength of materials, depends heavily on the processing power of computers and is more applicable to structures of arbitrary size and complexity.

    ppt6p hoccom001 27-01-2016 6 2   Download

  • Phrase-structure grammars are an effective representation for important syntactic and semantic aspects of natural languages, but are computationally too demanding for use as language models in real-time speech recognition. An algorithm is described that computes finite-state approximations for context-free grammars and equivalent augmented phrase-structure grammar formalisms. The approximation is exact for certain contextfree grammars generating regular languages, including all left-linear and right-linear context-free grammars. ...

    pdf10p bunmoc_1 20-04-2013 9 1   Download

  • We present a new grammatical formalism called Constraint Dependency G r a m m a r (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed.

    pdf8p bungio_1 03-05-2013 16 1   Download

  • This paper presents an application of finite state transducers weighted with feature structure descriptions, following Amtrup (2003), to the morphology of the Semitic language Tigrinya. It is shown that feature-structure weights provide an efficient way of handling the templatic morphology that characterizes Semitic verb stems as well as the long-distance dependencies characterizing the complex Tigrinya verb morphotactics. A relatively complete computational implementation of Tigrinya verb morphology is described. ...

    pdf9p bunthai_1 06-05-2013 9 1   Download

  • 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.

    pdf8p buncha_1 08-05-2013 20 1   Download

  • This chapter and the next are devoted to enumeration, where the problem is to determine the number of combinatorial configurations described by finite rules, and do so for all possible sizes. This chapter presents the following content: Symbolic method, trees and strings, powersets and multisets, compositions and partitions, substitution.

    pdf61p allbymyself_08 22-02-2016 8 1   Download

  • In this chapter, we examine some of the most important classes of labelled objects, including surjections, set partitions, permutations, as well as labelled graphs, trees, and mappings from a finite set into itself. Certain aspects of words can also be treated by this theory, a fact which has important consequences not only in combinatorics itself but also in probability and statistics.

    pdf81p allbymyself_08 22-02-2016 3 1   Download

  • A hierarchical ordering of a finite number of objects may be stored in a tree data structure. Operations on a hierarchically stored container include: Accessing the root, given an object in the container: Access the parent of the current object, find the degree of the current object, get a reference to a child, attach a new sub-tree to the current object, detach this tree from its parent.

    pdf21p allbymyself_08 22-02-2016 6 1   Download

  • A better understanding of the influence of tobacco smoke on the host response to periodontal infection has been the major concern in numerous studies whereas, limited research has been published aiming to identify the influence of tobacco smoke on the dental biofilm. Tobacco smoke has been shown to cause shifts in the microbial species that comprise dental plaque (Haffajee & Socransky 2001, Kamma et al. 1999, Shiloah et al. 2000, Umeda et al. 1998, van Winkelhoff et al. 2001, Zambon et al. 1996). In a recent study by our group (Buduneli et al.

    pdf177p pt_1669 26-03-2012 313 100   Download

  • The analysis model of a structure includes nodes (joints), elements and boundary conditions. Finite elements are used in data entry, representing members of the structure for numerical analysis, and nodes define the locations of such members. Boundary conditions represent the status of connections between the structure and neighboring structures such as foundations. A structural analysis refers to mathematical simulations of a numerical analysis model of a structure.

    pdf316p muahong54 12-05-2013 41 24   Download

CHỦ ĐỀ BẠN MUỐN TÌM

Đồng bộ tài khoản