6-letter words containing a, k
- faking — Present participle of fake.
- fakirs — Plural form of fakir.
- fankle — to entangle
- fawkes — Guy, 1570–1606, English conspirator and leader in the Gunpowder plot of 1605: Guy Fawkes Day is observed on November 5 by the building of effigies and bonfires.
- flacks — Plural form of flack.
- flaked — fake2 (defs 2, 3).
- flaker — a small, flat, thin piece, especially one that has been or become detached from a larger piece or mass: flakes of old paint.
- flakes — Plural form of flake.
- flakey — of or like flakes.
- flaks' — antiaircraft fire, especially as experienced by the crews of combat airplanes at which the fire is directed.
- flanks — Third-person singular simple present indicative form of flank.
- flasks — Plural form of flask.
- fohawk — Alternative spelling of fauxhawk.
- frakel — (obsolete) Fraked.
- franck — César (Auguste) [sey-zar oh-gyst] /seɪˈzar oʊˈgüst/ (Show IPA), 1822–90, French composer, born in Belgium.
- franko — Ivan [ee-vahn] /iˈvɑn/ (Show IPA), 1856–1916, Ukrainian writer.
- franks — Plural form of frank.
- franky — a male given name, form of Frank.
- freaks — Plural form of freak.
- freaky — freakish.
- friska — a fast section in the music of a Hungarian folk dance or in a piece of music of this style
- funkia — plantain lily.
- gagaku — the select group of Japanese men who, as both dancers and musicians, perform the bugaku.
- galyak — a sleek, flat fur made from lambskin or from the pelt of a young goat.
- gasket — a rubber, metal, or rope ring, for packing a piston or placing around a joint to make it watertight.
- gaskin — a gasket.
- gawked — to stare stupidly; gape: The onlookers gawked at arriving celebrities.
- gawker — Someone who gawks, someone who stares stupidly.
- gdansk — a seaport in N Poland, on the Gulf of Danzig.
- gilyak — Nivkh.
- glinka — Mikhail Ivanovich [mi-kah-eel i-vah-nuh-vich;; Russian myi-khuh-yeel ee-vah-nuh-vyich] /mɪ kɑˈil ɪˈvɑ nə vɪtʃ;; Russian myɪ xʌˈyil iˈvɑ nə vyɪtʃ/ (Show IPA), 1803–57, Russian composer.
- gurkha — a member of a Rajput people, Hindu in religion, who achieved dominion over Nepal in the 18th century.
- h-back — a wingback or slotback
- hacked — to place (something) on a hack, as for drying or feeding.
- hackee — (US, dialect) The chickaree or red squirrel.
- hacker — a person, as an artist or writer, who exploits, for money, his or her creative ability or training in the production of dull, unimaginative, and trite work; one who produces banal and mediocre work in the hope of gaining commercial success in the arts: As a painter, he was little more than a hack.
- hackie — hack2 (def 7b).
- hackle — one of the long, slender feathers on the neck or saddle of certain birds, as the domestic rooster, much used in making artificial flies for anglers.
- hackly — rough or jagged, as if hacked: Some minerals break with a hackly fracture.
- haiduk — one of a class of mercenary soldiers in 16th-century Hungary.
- haikai — an informal type of linked verse originated by Bashō, a 17th-century Japanese poet.
- haikou — a city on N Hainan island, in SE China.
- haikus — Plural form of haiku.
- hakari — a feast which follows a ceremonial funeral or other important occasion
- hakeas — Plural form of hakea.
- hakeem — a male given name.
- hakham — a wise and learned person; sage.
- hakims — Plural form of hakim.
- hakmem — (publication) /hak'mem/ MIT AI Memo 239 (February 1972). A legendary collection of neat mathematical and programming hacks contributed by many people at MIT and elsewhere. (The title of the memo really is "HAKMEM", which is a 6-letterism for "hacks memo".) Some of them are very useful techniques, powerful theorems, or interesting unsolved problems, but most fall into the category of mathematical and computer trivia. Here is a sampling of the entries (with authors), slightly paraphrased: Item 41 (Gene Salamin): There are exactly 23,000 prime numbers less than 2^18. Item 46 (Rich Schroeppel): The most *probable* suit distribution in bridge hands is 4-4-3-2, as compared to 4-3-3-3, which is the most *evenly* distributed. This is because the world likes to have unequal numbers: a thermodynamic effect saying things will not be in the state of lowest energy, but in the state of lowest disordered energy. Item 81 (Rich Schroeppel): Count the magic squares of order 5 (that is, all the 5-by-5 arrangements of the numbers from 1 to 25 such that all rows, columns, and diagonals add up to the same number). There are about 320 million, not counting those that differ only by rotation and reflection. Item 154 (Bill Gosper): The myth that any given programming language is machine independent is easily exploded by computing the sum of powers of 2. If the result loops with period = 1 with sign +, you are on a sign-magnitude machine. If the result loops with period = 1 at -1, you are on a twos-complement machine. If the result loops with period greater than 1, including the beginning, you are on a ones-complement machine. If the result loops with period greater than 1, not including the beginning, your machine isn't binary - the pattern should tell you the base. If you run out of memory, you are on a string or bignum system. If arithmetic overflow is a fatal error, some fascist pig with a read-only mind is trying to enforce machine independence. But the very ability to trap overflow is machine dependent. By this strategy, consider the universe, or, more precisely, algebra: Let X = the sum of many powers of 2 = ...111111 (base 2). Now add X to itself: X + X = ...111110. Thus, 2X = X - 1, so X = -1. Therefore algebra is run on a machine (the universe) that is two's-complement. Item 174 (Bill Gosper and Stuart Nelson): 21963283741 is the only number such that if you represent it on the PDP-10 as both an integer and a floating-point number, the bit patterns of the two representations are identical. Item 176 (Gosper): The "banana phenomenon" was encountered when processing a character string by taking the last 3 letters typed out, searching for a random occurrence of that sequence in the text, taking the letter following that occurrence, typing it out, and iterating. This ensures that every 4-letter string output occurs in the original. The program typed BANANANANANANANA.... We note an ambiguity in the phrase, "the Nth occurrence of." In one sense, there are five 00's in 0000000000; in another, there are nine. The editing program TECO finds five. Thus it finds only the first ANA in BANANA, and is thus obligated to type N next. By Murphy's Law, there is but one NAN, thus forcing A, and thus a loop. An option to find overlapped instances would be useful, although it would require backing up N - 1 characters before seeking the next N-character string. Note: This last item refers to a Dissociated Press implementation. See also banana problem. HAKMEM also contains some rather more complicated mathematical and technical items, but these examples show some of its fun flavour. HAKMEM is available from MIT Publications as a TIFF file.
- hanked — a skein, as of thread or yarn.