0%

15-letter words containing a, n, p, h

  • de bruijn graph — (mathematics)   A class of graphs with elegant properties. De Bruijn graphs are especially easy to use for routing, with shifting of source and destination addresses.
  • developing bath — an amount of photographic developer into which photographic film or paper is inserted
  • diphenhydramine — a white, crystalline, antihistaminic compound, C 17 H 21 NO, used orally, topically, and parenterally, especially for allergies.
  • draughtproofing — Present participle of draughtproof.
  • draughtsmanship — (British) alternative spelling of draftsmanship.
  • drop handlebars — aerodynamic handlebars that drop down and curve towards the rider at the ends rather than turning upwards as on conventional bicycles
  • dutchman's-pipe — a climbing vine, Aristolochia durior, of the birthwort family, having large, heart-shaped leaves and brownish-purple flowers of a curved form suggesting a tobacco pipe.
  • dystrophication — the process by which a body of water becomes dystrophic.
  • edmund randolph — A(sa) Philip, 1889–1979, U.S. labor leader: president of the Brotherhood of Sleeping Car Porters 1925–68.
  • edriophthalmian — edriophthalmous
  • elephant's-foot — a monocotyledonous plant, Testudinaria elephantipes, of southern Africa, with a very large starchy tuberous stem, covered in corky scales: family Dioscoreaceae
  • enantiomorphism — (chemistry) The relationship exhibited by a pair of enantiomorphs.
  • enantiomorphous — Of or pertaining to enantiomorphs or enantiomorphism; enantiomorphic.
  • encephalization — (biology) the amount of brain mass exceeding that related to an animal's total body mass.
  • encephalography — Any of various techniques for recording the structure or electrical activity of the brain.
  • encephalopathic — Relating to encephalopathy.
  • endolymphangial — (anatomy) Within a lymphatic vessel.
  • english sparrow — a small Eurasian weaverbird, Passer domesticus, now established in North America and Australia. It has a brown streaked plumage with grey underparts
  • english speaker — a person who speaks English as a first, or second mother tongue
  • enterohepatitis — dual inflammation of the intestine and liver
  • ergatandromorph — an ant with the characteristics of both worker and male
  • fahnestock clip — a type of terminal using a spring that clamps readily onto a connecting wire.
  • finger alphabet — a series of shapes made by the fingers that indicate letters of an alphabet and can be used in fingerspelling for the deaf
  • for their pains — You say that something was all you got for your pains when you are mentioning the disappointing result of situation into which you put a lot of work or effort.
  • franz joseph ii — 1906–1989, prince of Liechtenstein 1938–89.
  • french-speaking — able to speak French
  • galloping-ghost — Harold ("Red"; "the Galloping Ghost") 1903–1991, U.S. football player.
  • german shepherd — one of a breed of large shepherd dogs having a coat ranging in color from gray to brindled, black-and-tan, or black, used especially in police work and as a guide for the blind.
  • gigantopithecus — a genus of extinct ape of southern Asia existing during the Pliocene and Pleistocene epochs, known only from very large fossil jaws and teeth and believed to be perhaps the biggest hominoid that ever lived.
  • golden pheasant — an Asiatic pheasant, Chrysolophus pictus, having brilliant scarlet, orange, gold, green, and black plumage.
  • golden samphire — a Eurasian coastal plant, Inula crithmoides, with fleshy leaves and yellow flower heads: family Asteraceae (composites)
  • gramophonically — in a gramophonic manner
  • grandparenthood — The state of being a grandparent.
  • graph colouring — (application)   A constraint-satisfaction problem often used as a test case in research, which also turns out to be equivalent to certain real-world problems (e.g. register allocation). Given a connected graph and a fixed number of colours, the problem is to assign a colour to each node, subject to the constraint that any two connected nodes cannot be assigned the same colour. This is an example of an NP-complete problem. See also four colour map theorem.
  • graph reduction — A technique invented by Chris Wadsworth where an expression is represented as a directed graph (usually drawn as an inverted tree). Each node represents a function call and its subtrees represent the arguments to that function. Subtrees are replaced by the expansion or value of the expression they represent. This is repeated until the tree has been reduced to a value with no more function calls (a normal form). In contrast to string reduction, graph reduction has the advantage that common subexpressions are represented as pointers to a single instance of the expression which is only reduced once. It is the most commonly used technique for implementing lazy evaluation.
  • graphic granite — a pegmatite that has crystals of gray quartz imbedded in white or pink microcline in such a manner that they resemble cuneiform writing.
  • gynandromorphic — (of an organism) Having male and female characteristics.
  • hair transplant — the surgical transfer of clumps of skin with hair or of viable hair follicles from one site of the body to another, usually performed to correct baldness.
  • halting problem — The problem of determining in advance whether a particular program or algorithm will terminate or run forever. The halting problem is the canonical example of a provably unsolvable problem. Obviously any attempt to answer the question by actually executing the algorithm or simulating each step of its execution will only give an answer if the algorithm under consideration does terminate, otherwise the algorithm attempting to answer the question will itself run forever. Some special cases of the halting problem are partially solvable given sufficient resources. For example, if it is possible to record the complete state of the execution of the algorithm at each step and the current state is ever identical to some previous state then the algorithm is in a loop. This might require an arbitrary amount of storage however. Alternatively, if there are at most N possible different states then the algorithm can run for at most N steps without looping. A program analysis called termination analysis attempts to answer this question for limited kinds of input algorithm.
  • hapax legomenon — a word or phrase that appears only once in a manuscript, document, or particular area of literature.
  • hardhead sponge — any of several commercial sponges, as Spongia officinalis dura, of the West Indies and Central America, having a harsh, fibrous, resilient skeleton.
  • hardy perennial — a plant that lasts three seasons or more and that can withstand freezing temperatures
  • haulage company — a firm that transports goods by lorry
  • hautes-pyrenees — a department in SW France. 1751 sq. mi. (4535 sq. km). Capital: Tarbes.
  • have (down) pat — to know or have memorized thoroughly
  • have one's pick — If you have your pick of a group of things, you are able to choose any of them that you want.
  • hawaiian pidgin — an English-based creole widely spoken in Hawaii.
  • heart operation — a surgical operation performed on the heart
  • heart tamponade — tamponade (def 2).
  • hematoporphyrin — a porphyrin made by treating haemoglobin with acid, used to treat cancer in photodynamic therapy
Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?