-
1 phrase
freiz
1. noun1) (a small group of words (usually without a finite verb) which forms part of an actual or implied sentence: He arrived after dinner.) frase2) (a small group of musical notes which follow each other to make a definite individual section of a melody: the opening phrase of the overture.) frase
2. verb(to express (something) in words: I phrased my explanations in simple language.) expresar- phrasing
- phrase-book
- phrasal verb
phrase n frasetr[freɪz]3 SMALLMUSIC/SMALL frase nombre femenino1 (express) expresar2 SMALLMUSIC/SMALL frasear\SMALLIDIOMATIC EXPRESSION/SMALLphrase book guía de conversación para el viajerophrase n: frase f, locución fto coin a phrase: para decirlo asín.• expresión s.f.• frase s.f.• locución s.f.v.• expresar v.• frasear v.
I freɪznoun frase f, locución fto coin a phrase — por así decirlo; (before n)
phrase book — manual m de conversación, ≈guía f de bolsillo para el viajero
II
transitive verb expresar, formular[freɪz]1. N1) (Gram, Mus) frase fnoun/verb phrase — frase f nominal/verbal
2) (=expression) frase fI think, to use or to borrow your phrase, that... — creo que, usando tus propias palabras,...
2. VT1) (orally) expresar, formularI should have phrased that better — debería haberlo expresado or formulado mejor
2) (in writing) redactar, expresarcan we phrase that differently? — ¿podemos redactar or expresar eso de otro modo?
3) (Mus) frasear3.CPDphrase book N — libro m de frases
phrase marker N — (Ling) marcador m de frase
phrase structure N — (Ling) estructura f de frase
* * *
I [freɪz]noun frase f, locución fto coin a phrase — por así decirlo; (before n)
phrase book — manual m de conversación, ≈guía f de bolsillo para el viajero
II
transitive verb expresar, formular
См. также в других словарях:
Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… … Wikipedia
Finite difference method — In mathematics, finite difference methods are numerical methods for approximating the solutions to differential equations using finite difference equations to approximate derivatives. Intuitive derivation Finite difference methods approximate the … Wikipedia
Finite field arithmetic — Arithmetic in a finite field is different from standard integer arithmetic. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.While each finite field is … Wikipedia
Finite strain theory — Continuum mechanics … Wikipedia
Expression (mathematics) — In mathematics, an expression is a finite combination of symbols that is well formed according to rules that depend on the context. Symbols can designate numbers (constants), variables, operations, functions, and other mathematical symbols, as… … Wikipedia
expression — by Claire Colebrook Expression is one of Deleuze s most intense concepts. If we take Deleuze s definition of a concept that it is a philosophical creation that produces an intensive set of ordinates then expression can be understood as… … The Deleuze dictionary
expression — by Claire Colebrook Expression is one of Deleuze s most intense concepts. If we take Deleuze s definition of a concept that it is a philosophical creation that produces an intensive set of ordinates then expression can be understood as… … The Deleuze dictionary
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Parsing expression grammar — A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language. A parsing expression grammar essentially represents a recursive… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… … Wikipedia